problem_id
stringlengths
6
6
user_id
stringlengths
10
10
time_limit
float64
1k
8k
memory_limit
float64
262k
1.05M
problem_description
stringlengths
48
1.55k
codes
stringlengths
35
98.9k
status
stringlengths
28
1.7k
submission_ids
stringlengths
28
1.41k
memories
stringlengths
13
808
cpu_times
stringlengths
11
610
code_sizes
stringlengths
7
505
p03101
u158126367
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['N,M,C = map(int, input().split())\nB = list(map(int, input().split()))\nans=0\nfor i in range(N):\n A = list(map(int, input().split()))\n ssum = sum([A[i]*B[i] for i in range(M)])+C\n if ssum>0:\n ans+=1\nprint(ans)', 'H,W=map(int, (input().split()))\nh,w=map(int, (input().split()))\nans=H*W-h*W-H*w+h*w\nprint(ans)']
['Runtime Error', 'Accepted']
['s247392921', 's193851414']
[3188.0, 2940.0]
[19.0, 17.0]
[223, 94]
p03101
u161201983
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['N = int(input())\nA = int(input())\nB = int(input())\nC = int(input())\nD = int(input())\nE = int(input())\n \nmin = min(A, B, C, D, E)\n \nans = 4 + int(N/min)\nif N % min != 0:\n ans = ans + 1\nprint(ans)', 'H, W = map(int,input().split())\nh, w = map(int,input().split())\n\nval = H * (W - w)\ndis = h*(W-w)\nval = val - dis\nprint(val)']
['Runtime Error', 'Accepted']
['s940453936', 's679134988']
[3064.0, 2940.0]
[18.0, 18.0]
[197, 123]
p03101
u163449343
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(input().spilt())\nw,h = map(input().spilt())\nprint((H - h) * (W - w))', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint((H - h) * (W - w))']
['Runtime Error', 'Accepted']
['s865534638', 's403582348']
[2940.0, 2940.0]
[17.0, 18.0]
[78, 86]
p03101
u163874353
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int, input().split())\nh, w = map(int, input().split())\nprint(h * W + w* H - h * w)', 'H,W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H * W -(h * W + w* H - h * w))']
['Wrong Answer', 'Accepted']
['s667937982', 's440331351']
[2940.0, 2940.0]
[17.0, 17.0]
[92, 101]
p03101
u170765582
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a,b=map(int,input())\nc,d=map(int,input())\nprint((a-c)*(b-d))', 'a,b=map(int,input().split())\nc,d=map(int,input().split())\nprint((a-c)*(b-d))']
['Runtime Error', 'Accepted']
['s606782874', 's038656235']
[2940.0, 2940.0]
[17.0, 17.0]
[60, 76]
p03101
u172493590
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['input_1 = input().split()\n\ninput_2 = input().split()\n\nprint((int(input_1[0]) - int(input_2[0])) * (int(input_1[1]) * int(input_2[1])))\n', 'input_1 = input().split()\nh_l = int(input_1[0])\nw_l = int(input_1[1])\n\ninput_2 = input().split()\nh = int(input_2[0])\nw = int(input_2[1])\n\nresult = (h_l - h) * (w_l * w)\n\nprint(result)\n', 'input_1 = input().split()\n\nh_l = int(input_1[0])\nw_l = int(input_1[1])\n\ninput_2 = input().split()\n\nh = int(input_2[0])\nw = int(input_2[1])\n\nresult = h_l * w_l - (h_l * w + w_l * h) + w * h\n\nprint(result)\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s803825602', 's843195299', 's731672909']
[2940.0, 2940.0, 3060.0]
[17.0, 17.0, 19.0]
[135, 184, 205]
p03101
u174394352
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(h*W+H*w-h*w)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-h*W-H*w+h*w)\n']
['Wrong Answer', 'Accepted']
['s053137136', 's482287312']
[2940.0, 2940.0]
[17.0, 17.0]
[76, 81]
p03101
u174536291
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a = [list(map(int, input().split())) for i in range(2)]\na[0][0] = H\na[0][1] = W\na[1][0] = h\na[1][1] = w\nmy_result = H * W - h * W - H * w + h * w\nprint(my_result)', 'a = [list(map(int, input().split())) for i in range(2)]\nH = a[0][0] \nW = a[0][1] \nh = a[1][0] \nw = a[1][1] \nmy_result = H * W - h * W - H * w + h * w\nprint(my_result)']
['Runtime Error', 'Accepted']
['s399363510', 's039509380']
[9092.0, 9136.0]
[23.0, 32.0]
[162, 166]
p03101
u177132624
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int,input().split())\nh,w = map(int,input().split())\n\nprint(H*W-H*w-h*W-h*w)', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\n \nprint(H*W-H*w-h*W+h*w)']
['Wrong Answer', 'Accepted']
['s227959997', 's173033846']
[2940.0, 2940.0]
[17.0, 17.0]
[85, 86]
p03101
u178888901
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a,b = map(int,input.split())\nc,d=map(int,input.split())\nprint((c-a)*(d-b))', 'a,b = map(int,input().split())\nc,d=map(int,input().split())\nprint((c-a)*(d-b))']
['Runtime Error', 'Accepted']
['s667332329', 's421064197']
[2940.0, 2940.0]
[18.0, 17.0]
[74, 78]
p03101
u181215519
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map( int, input().split() )\nprint( (H-1) * (W-1) )', 'H, W = map( int, input().split() )\nh, w = map( int, input().split() )\nprint( (H-h) * (W-w) )']
['Wrong Answer', 'Accepted']
['s539089409', 's341932697']
[2940.0, 2940.0]
[17.0, 17.0]
[57, 92]
p03101
u184796829
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-H*h-W*w+h*w)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-H*w-W*h+h*w)']
['Wrong Answer', 'Accepted']
['s525434271', 's080920316']
[9104.0, 9168.0]
[31.0, 27.0]
[80, 80]
p03101
u185354171
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['ap(int,input().split())', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\n\nprint((H-h)*(W-w))\n']
['Runtime Error', 'Accepted']
['s719649264', 's448300944']
[2940.0, 2940.0]
[17.0, 17.0]
[23, 82]
p03101
u188745744
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['3 2\n2 1', 'H,W=list(map(int,input().split()))\nh,w=list(map(int,input().split()))\nprint(H*W-h*W-w*H+h*w)']
['Runtime Error', 'Accepted']
['s586425401', 's532196622']
[9076.0, 9160.0]
[23.0, 25.0]
[7, 92]
p03101
u188916636
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['(H-h) * (W-w)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h)*(W-w))']
['Runtime Error', 'Accepted']
['s923114257', 's546263149']
[2940.0, 3064.0]
[17.0, 17.0]
[13, 84]
p03101
u194894739
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nwhite_cells_int = H * W - ((h * W) + (w * H) - (h * w)\nprint(white_cells_int)\n', 'n, m, c = map(int,input().split())\nB = list(map(int,input().split()))\nA = [input().split() for l in range(n)]\ncnt = 0\nfor i in range(n):\n sum = 0\n for j in range(m):\n sum += int(A[i][j]) * B[j]\n if sum + c > 0:\n cnt += 1\nprint(cnt)\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nwhite_cells_int = H * W - ((h * W) + (w * H) - (h * w))\nprint(str(white_cells_int))\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s554784066', 's934988781', 's552661896']
[2940.0, 3060.0, 2940.0]
[17.0, 17.0, 17.0]
[145, 255, 151]
p03101
u195396655
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H*W - h*w)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h) * (W-w))']
['Wrong Answer', 'Accepted']
['s303918964', 's016380727']
[2940.0, 2940.0]
[17.0, 17.0]
[82, 86]
p03101
u201489353
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
["import numpy as np\n\nN, M = map(int, input().split())\nA = []\nB = []\n\nfor i in range(0, N):\n a, b = np.array(list(map(float, input().split())))\n A.append(a)\n B.append(b)\n\ncnt = 0\nsum = 0\nflag = 0\ninf = float('inf')\narrayA = np.array(A)\narrayB = np.array(B)\nfor j in range(0, N):\n idx = A.index(min(arrayA))\n pay = arrayA[idx]\n num = arrayB[idx]\n arrayA[idx]=inf\n if cnt + num < M :\n cnt += num\n sum += pay*num\n else :\n diff = int(M - cnt)\n for t in range(0, diff):\n sum += pay\n cnt += 1\n if cnt == M :\n flag = 1\n print(int(sum))\n break\n if flag == 1:\n break\n", 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nall = H * W\nprint(all - (h*W + w * H - h*w))\n']
['Runtime Error', 'Accepted']
['s707069152', 's676851755']
[12500.0, 2940.0]
[156.0, 17.0]
[699, 111]
p03101
u203995947
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
["n,m = map(int,input().split(' '))\ncost = 0\ncount = 0\n\nmlist = list()\nfor i in range(n):\n mlist.append(list(map(int,input().split(' '))))\nmlist.sort(key=lambda x: x[0])\n\nfor i in range(n):\n ablist = mlist[i]\n if count+ablist[1] <= m:\n count += ablist[1]\n cost += ablist[0]*ablist[1] \n else:\n for j in range(ablist[1]):\n count += 1\n if count <= m:\n cost += ablist[0]\n else:\n break_t = True\n break\n if break_t:\n break\nprint(cost)\n\n", "hh, ww = map(int,input().split(' '))\nh, w = map(int,input().split(' '))\nans = (hh-h)*(ww-w)\nprint(ans)"]
['Runtime Error', 'Accepted']
['s534088092', 's740567980']
[3064.0, 2940.0]
[18.0, 17.0]
[485, 102]
p03101
u204904256
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['A,B = input().split()\na,b = input().split()\nprint(A*B-a*B-b*A+a*b)', 'A,B = input().split()\na,b = input().split()\nA = int(A)\nB = int(B)\na = int(a)\nb = int(b)\nprint(A*B-a*B-b*A+a*b)']
['Runtime Error', 'Accepted']
['s925264889', 's410849555']
[2940.0, 2940.0]
[17.0, 17.0]
[66, 110]
p03101
u205769672
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nhi,wi=map(int,input().split())\n\nprint(W*hi+H*wi-hi*wi)', 'H,W=map(int,input().split())\nhi,wi=map(int,input().split())\n\nprint(W*H-W*hi-H*wi+hi*wi)']
['Wrong Answer', 'Accepted']
['s542565810', 's829977306']
[2940.0, 2940.0]
[17.0, 17.0]
[83, 87]
p03101
u216631280
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H * W - (h * w))\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H - h) * (W - w))']
['Wrong Answer', 'Accepted']
['s785423161', 's268063399']
[2940.0, 3064.0]
[17.0, 17.0]
[89, 90]
p03101
u217627525
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['h,w=map(int,input().split())\n_1,_2=map(int,input().split())\nprint((h-1)*(w-1))', 'h,w=map(int,input().split())\nh0,w0=map(int,input().split())\nprint((h-h0)*(w-w0))']
['Wrong Answer', 'Accepted']
['s386451380', 's965611689']
[3064.0, 2940.0]
[18.0, 17.0]
[78, 80]
p03101
u219015402
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['A, B = map(int,input().split())\n\npre = A\nfor i in range(A+1,B+1):\n pre = pre ^ i\nprint(pre)', 'H, W = map(int,input().split())\nh, w = map(int,input().split())\nans = (H-h) * (W-w)\nprint(ans)']
['Wrong Answer', 'Accepted']
['s389886131', 's844203592']
[2940.0, 2940.0]
[18.0, 17.0]
[95, 94]
p03101
u219503971
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input(),split())\nh, w = map(int, input(),split())\nprint((H-h)*(W-w))\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h)*(W-w))\n']
['Runtime Error', 'Accepted']
['s127971193', 's991213666']
[2940.0, 2940.0]
[17.0, 18.0]
[85, 85]
p03101
u221898645
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
["\ndef to_bin(n):\n s = ''\n while n > 0:\n s += str(n%2)\n n //= 2\n return s[::-1]\n\ndef xor(s1, s2):\n s1 = '0'*(len(s2)-len(s1)) + s1\n result = ''\n for i in range(len(s1)):\n if s1[i] == s2[i]:\n result += '0'\n else:\n result += '1'\n return result\n\ndef to_den(s):\n s = s[::-1]\n total = 0\n for i in range(0, len(s)):\n total += 2**i*int(s[i])\n return total\n\ndef main():\n A, B = map(int, input().split())\n if A == B:\n print(A)\n exit(1)\n\n cur = xor(to_bin(A), to_bin(A+1))\n\n for i in range(A+2, B+1):\n s = to_bin(i)\n cur = xor(cur, s)\n\n print(to_den(cur))\n\nmain()\n", "\ndef to_bin(n):\n s = ''\n while n > 0:\n s += str(n%2)\n n //= 2\n return s[::-1]\n\ndef xor(s1, s2):\n s1 = '0'*(len(s2)-len(s1)) + s1\n result = ''\n for i in range(len(s1)):\n if s1[i] == s2[i]:\n result += '0'\n else:\n result += '1'\n return result\n\ndef to_den(s):\n s = s[::-1]\n total = 0\n for i in range(0, len(s)):\n total += 2**i*int(s[i])\n return total\n\nA, B = map(int, input().split())\nif A == B:\n print(A)\nelse:\n cur = xor(to_bin(A), to_bin(A+1))\n\n for i in range(A+2, B+1):\n s = to_bin(i)\n cur = xor(cur, s)\n\n print(to_den(cur))\n\n", "\ndef to_bin(n):\n s = ''\n while n > 0:\n s += str(n%2)\n n //= 2\n return s[::-1]\n\ndef xor(s1, s2):\n s1 = '0'*(len(s2)-len(s1)) + s1\n result = ''\n for i in range(len(s1)):\n if s1[i] == s2[i]:\n result += '0'\n else:\n result += '1'\n return result\n\ndef to_den(s):\n s = s[::-1]\n total = 0\n for i in range(0, len(s)):\n total += 2**i*int(s[i])\n return total\n\ndef main():\n A, B = map(int, input().split())\n if A == B:\n print(A)\n else:\n cur = xor(to_bin(A), to_bin(A+1))\n\n for i in range(A+2, B+1):\n s = to_bin(i)\n cur = xor(cur, s)\n\n print(to_den(cur))\n\nmain()\n", 'H, W = map(int, input().split())\nh,w = map(int, input().split())\n\nprint(abs(H-h)*abs(W-w))']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s030971470', 's390642921', 's833306621', 's424565883']
[3064.0, 3064.0, 3064.0, 2940.0]
[18.0, 18.0, 17.0, 18.0]
[605, 573, 610, 90]
p03101
u223646582
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input())\nh, w = map(int, input())\n\nprint((H-h) * (H-h))\n', 'H, W = map(int, input())\nh, w = map(int, input())\n\nprint((W-w) * (H-h))\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((W-w) * (H-h))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s073886685', 's277488078', 's297245937']
[2940.0, 2940.0, 2940.0]
[17.0, 18.0, 17.0]
[72, 72, 87]
p03101
u224554402
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['p,q= input().split()\na,b =(int(p), int(q))\nP,Q= input().split()\nA,B =(int(P), int(Q))\nprint(int(a*b - A*B))', 'p,q= input().split()\na,b =(int(p), int(q))\nP,Q= input().split()\nA,B =(int(P), int(Q))\nprint(int((a-A)*(b-B)))']
['Wrong Answer', 'Accepted']
['s599488263', 's075779680']
[2940.0, 3060.0]
[17.0, 17.0]
[107, 109]
p03101
u226400521
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['def get_ints():\n return map(int, input().split())\n\nN, _, C = get_ints()\nB = list(get_ints())\n\nn = 0\nfor _ in range(N):\n A = list(get_ints())\n J = sum(a * b for a, b in zip(A, B)) + C\n if J > 0:\n \tn += 1\n \nprint(n)\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((H - h) * (W - w))']
['Runtime Error', 'Accepted']
['s349375230', 's081215467']
[2940.0, 2940.0]
[17.0, 17.0]
[222, 91]
p03101
u228232845
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
["from collections import defaultdict, deque\nimport sys\n\nINF = float('inf')\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\ndef I(): return int(sys.stdin.buffer.readline())\ndef LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\ndef S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef LSR(n): return [LS() for i in range(n)]\ndef SRL(n): return [list(S()) for i in range(n)]\ndef MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\n\n\nh1, w1 = LI()\nh, w = LI()\nans = max(0, h * w)\nprint(ans)\n", "from collections import defaultdict, deque\nimport sys\n\nINF = float('inf')\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\ndef I(): return int(sys.stdin.buffer.readline())\ndef LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\ndef S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef LSR(n): return [LS() for i in range(n)]\ndef SRL(n): return [list(S()) for i in range(n)]\ndef MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\n\n\nh1, w1 = LI()\nh, w = LI()\nans = max(0, (h1 - h) * (w1 - w))\nprint(ans)\n"]
['Wrong Answer', 'Accepted']
['s362958564', 's982884521']
[3316.0, 3316.0]
[21.0, 21.0]
[687, 701]
p03101
u230889498
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int,input().split())\nh,w = map(int,input().split())\n\nprint((H*W + h*w) - (H*w + Wh))', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\n\nprint((H*W + h*w) - (H*w + W*h))']
['Runtime Error', 'Accepted']
['s280457204', 's292688562']
[2940.0, 2940.0]
[18.0, 17.0]
[94, 95]
p03101
u232852711
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(list, input().split())\nh, w = map(list, input().split())\n\nprint((H-h)*(W-w))\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((H-h)*(W-w))\n']
['Runtime Error', 'Accepted']
['s482082109', 's097366347']
[2940.0, 2940.0]
[18.0, 20.0]
[88, 86]
p03101
u244836567
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a,b=input().split()\nc,d=input().split()\nprint((a-c)*(b-d))', 'a,b=input().split()\nc,d=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nd=int(d)\nprint((a-c)*(b-d))']
['Runtime Error', 'Accepted']
['s543864976', 's432200019']
[9088.0, 9108.0]
[28.0, 28.0]
[58, 94]
p03101
u248364740
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['3 2\n2 1', 'H, W = map(int, input().strip().split())\nh, w = map(int, input().strip().split())\n\nres = (H - h) * (W - w)\nprint(res)\n']
['Runtime Error', 'Accepted']
['s795860855', 's436819938']
[9004.0, 9048.0]
[25.0, 28.0]
[7, 118]
p03101
u255943004
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int,input())\nr,c = map(int,input())\n\nimport numpy as np\n\nmatrix = np.ones((H,W),dtype="uint8")\nmatrix[0:r,:] = 0\nmatrix[:,0:c] = 0\nprint(matrix.sum())\n', 'H,W = map(int,input().split())\nr,c = map(int,input().split())\n\nimport numpy as np\n\nmatrix = np.ones((H,W),dtype="uint8")\nmatrix[0:r,:] = 0\nmatrix[:,0:c] = 0\nprint(matrix.sum())\n']
['Runtime Error', 'Accepted']
['s698618508', 's513003988']
[2940.0, 12504.0]
[17.0, 151.0]
[161, 177]
p03101
u256464928
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int,input().split)\nh,w = map(int,input().split)\nprint((H*W)-(h*w))', 'List = [list(map(int,input().split())) for i in range(2)]\nprint((List[0][0]-List[1][0])*(List[0][1]*List[1][1]))', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint((H*W)-(h*w))', 'List = [list(map(int,input().split())) for i in range(2)]\nprint((List[0][0]*List[0][1])-(List[1][0]*List[1][1]))', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint((H-h)*(W-w))']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s324107527', 's450211715', 's594387605', 's842886840', 's645338324']
[2940.0, 2940.0, 2940.0, 3060.0, 2940.0]
[19.0, 17.0, 17.0, 17.0, 17.0]
[76, 112, 80, 112, 80]
p03101
u256868077
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-h*W-w*h+h*w)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-h*W-w*H+h*w)\n']
['Wrong Answer', 'Accepted']
['s615351094', 's880088499']
[2940.0, 2940.0]
[17.0, 17.0]
[80, 81]
p03101
u258436671
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['N, M, C = map(int, input().split())\nB = [int(_) for _ in input().split()]\nfor i in range(1, N + 1):\n Ai = [int(_) for _ in input().split()]\nright = 0\nfor i in range(1,N + 1):\n for j in range(M):\n a = 0\n a += Ai[j] * B[j]\n if a + C > 0:\n right += 1\nprint(right)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nans = H * W - h * W - w * H + h * w\nprint(ans)']
['Runtime Error', 'Accepted']
['s235229166', 's667550954']
[3064.0, 2940.0]
[18.0, 18.0]
[290, 112]
p03101
u263188345
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['import numpy as np\n\ndef getInt():\n return map(int, input().split())\n\nN, M, C = getInt()\nB = list(getInt())\nans = 0\nfor i in range(N):\n A = list(getInt())\n if sum([a*b for (a,b) in (A,B)]) + C > 0:\n ans += 1\nprint(ans)\n ', 'import numpy as np\n\ndef main():\n """\n N, M, C = np.array([int(x) for x in input().split(\' \')])\n b_arr = np.array([int(x) for x in input().split(\' \')])\n a_mat = np.zeros((N,M))\n """\n N ,M, C = map(int, input().split())\n b_arr = np.array(list(map(int, input().split())))\n a_mat = np.array( [ list(map(int, input().split())) for i in range(N) ] )\n \n \n # a_mat[i] = np.array(list(map(int, input().split())))\n #a_mat[i] = np.array([int(x) for x in input().split(\' \')])\n\n #print ( len(list( np.where( a_mat.dot(b_arr)> -C ) )[0]) )\n print ( np.array(np.where(a_mat.dot(b_arr) > -C)).shape[1] )\n\nif __name__ == \'__main__\':\n main()\n', "import numpy as np\n\ndef main():\n N, M, C = np.array([int(x) for x in input().split(' ')])\n b_arr = np.array([int(x) for x in input().split(' ')])\n a_mat = np.zeros((N,M))\n\n for i in range(N):\n a_mat[i] = np.array([int(x) for x in input.split(' ')])\n\n print ( len(list( np.where( a_mat.dot(b_arr)> -C ) )[0]) )\n\nif __name__ == '__main__':\n main()\n", 'def F(n):\n res = 0\n if n % 4 == 0:\n res = n\n elif n % 4 == 1:\n res = 1\n elif n % 4 == 2:\n res = n + 1\n else:\n res = 0\n \n return res\n\ndef main():\n A, B = map(int, input().split())\n ans = F(B) ^ F(A-1)\n\n \n\n print(ans)\n\nmain()\n', 'import numpy as np\n\ndef main():\n N, M = map(int, input().split())\n\n AB= np.array([list(map(int, list(input().split()))) for _ in range(N)])\n print(AB)\n \n AB_sort_by_A = np.sort(AB.view(\'i8,i8\'), order=[\'f0\'], axis=0).view(np.int)\n\n print(AB_sort_by_A)\n buyNum = 0\n money = 0\n for i in range(N):\n if buyNum >= M:\n break\n else:\n drinkVal, drinkNum = AB_sort_by_A[i]\n if M - buyNum > drinkNum:\n buyNum += drinkNum\n money += drinkVal * drinkNum\n else:\n money += drinkVal * (M-buyNum)\n break\n print(money)\n \n \n \n\n \n \n \nif __name__ == "__main__":\n main()\n', 'import numpy as np\n\nprint(3)', "import numpy as np\n\ndef main():\n N, M, C = np.array([int(x) for x in input().split(' ')])\n b_arr = np.array([int(x) for x in input().split(' ')])\n a_mat = np.zeros((N,M))\n\n for i in range(N):\n a_mat[i] = np.array([int(x) for x in input().split(' ')])\n\n #print ( len(list( np.where( a_mat.dot(b_arr)> -C ) )[0]) ) \n print ( np.array(np.where(a_mat.dot(b_arr) > -C)).shape[1] )\n\nif __name__ == '__main__':\n main()\n", 'import numpy as np\n\ndef getInt():\n return map(int, input().split())\n\nN, M, C = getInt()\nB = list(getInt())\nans = 0\nfor i in range(N):\n A = list(getInt())\n if sum([a*b for a,b in zip(A,B)]) + C > 0:\n ans += 1\nprint(ans)', "import numpy as np\n\ndef main():\n N, M, C = np.array([int(x) for x in input().split(' ')])\n b_arr = np.array([int(x) for x in input().split(' ')])\n a_mat = np.zeros((N,M))\n\n for i in range(N):\n a_mat[i] = np.array([int(x) for x in input().split(' ')])\n\n print ( len(list( np.where( a_mat.dot(b_arr)> -C ) )[0]) )\n\nif __name__ == '__main__':\n main()\n\n", 'import numpy as np\ndef binary(_x):\n x = _x\n l = int(np.log2(x) + 1)\n res = [0] * l\n \n for i in range(l):\n res[i] += x%2\n x = int(x/2)\n return res\n\n\ndef a_xor(lis, i, sub, sub_max):\n return lis[i] * ( ( sub_max - sub + 1 ) % 2 )\n\n\ndef b_xor(lis, i, sub, sub_max):\n return lis[i] * ( ( sub_max - sub ) % 2 )\n\n\ndef main():\n A, B = map(int, input().split())\n bin_a = binary(A)\n bin_b = binary(B)\n odd_even_vec = [0] * len(bin_b)\n\n #print("a")\n sub = 0\n sub_max = 0\n for i, bit in enumerate(bin_a):\n if i == 0:\n odd_even_vec[i] += bit%2\n else:\n k = i-1\n sub += bit * 2**k\n sub_max += 2**k\n odd_even_vec[i] += a_xor(bin_a, i, sub, sub_max)\n \n\n #print("b")\n sub = 0\n sub_max = 0\n for i, bit in enumerate(bin_b):\n if i == 0:\n odd_even_vec[i] += bit%2\n else:\n k = i-1\n sub += bit * 2**k\n sub_max += 2**k\n odd_even_vec[i] += b_xor(bin_b, i, sub, sub_max)\n \n \n \n res = 0\n for i, bit in enumerate(odd_even_vec):\n res += bit%2 * 2**i\n\n print (res)\n\n \nmain()\n', 'def main():\n print("debug")\n \nif __name__ == \'__main__\':\n main()', 'import numpy as np\n\ndef getInt():\n return map(int, input().split())\n\nN, M, C = getInt()\nB = list(getInt())\nans = 0\nfor i in range(N):\n A = list(getInt())\n if sum(a*b for a,b in zip(A,B)) + C > 0:\n ans += 1\nprint(ans)', 'import numpy as np\n\ndef getInt():\n return map(int, input().split())\n\nN, M, C = getInt()\nB = list(getInt())\nans = 0\nfor i in range(N):\n A = list(getInt())\n if sum(a*b for a,b in zip(A,B)) + C > 0:\n ans += 1\nprint(ans)', 'import numpy as np\n\ndef main():\n """\n N, M, C = np.array([int(x) for x in input().split(\' \')])\n b_arr = np.array([int(x) for x in input().split(\' \')])\n a_mat = np.zeros((N,M))\n """\n N ,M, C = list(map(int, input().split()))\n b_arr = np.array(list(map(int, input().split())))\n a_mat = np.zeros((N,M))\n \n for i in range(N):\n a_mat[i] = np.array(list(map(int, input().split())))\n #a_mat[i] = np.array([int(x) for x in input().split(\' \')])\n\n #print ( len(list( np.where( a_mat.dot(b_arr)> -C ) )[0]) )\n print ( np.array(np.where(a_mat.dot(b_arr) > -C)).shape[1] )\n\nif __name__ == \'__main__\':\n main()\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nres = (H-h)*(W-w)\n\nprint(res)']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s020723416', 's165358288', 's260422307', 's361582010', 's385126082', 's452276963', 's471931414', 's544727101', 's675556214', 's707983838', 's724651246', 's734889064', 's756515943', 's927478236', 's803398389']
[12476.0, 12356.0, 12436.0, 2940.0, 14520.0, 12392.0, 12436.0, 12504.0, 12436.0, 12500.0, 2940.0, 12504.0, 12504.0, 12500.0, 2940.0]
[153.0, 153.0, 148.0, 17.0, 149.0, 154.0, 149.0, 150.0, 151.0, 148.0, 17.0, 150.0, 153.0, 149.0, 17.0]
[226, 699, 371, 315, 730, 28, 447, 224, 374, 1276, 67, 222, 222, 653, 96]
p03101
u263753244
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nh,w=map(int,input().split())\nka=h*w\nprint(H*W-ka)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nka=h*w\nprint(H*W-h*W-w*H+ka)']
['Wrong Answer', 'Accepted']
['s452562906', 's010427819']
[2940.0, 2940.0]
[17.0, 18.0]
[78, 86]
p03101
u266171694
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['n, m, c = map(int, input().split())\nb_list = list(map(int, input().split()))\ncount = 0\n\nfor _ in range(n):\n a_list = list(map(int, input().split()))\n sum = c\n\n for i in range(m):\n sum += a_list[i] * b_list[i]\n\n if sum > 0:\n count += 1\n\nprint(count)\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H - h) * (W - w))\n']
['Runtime Error', 'Accepted']
['s988916530', 's029996987']
[3060.0, 2940.0]
[17.0, 17.0]
[275, 91]
p03101
u268516119
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=input().split()\nh,w=input().split()\nprint((H-h)*(W-w))', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint((H-h)*(W-w))']
['Runtime Error', 'Accepted']
['s239211983', 's128566262']
[2940.0, 2940.0]
[18.0, 17.0]
[58, 76]
p03101
u268792407
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-h-w+1)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H+W-h-w+1)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-h*W-w*H+w*h)']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s406785298', 's791771018', 's645561091']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[74, 74, 80]
p03101
u273326224
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input.split())\nh, w = map(int, input.split())\n\nprint((H-h)*(W-w))', 'a = [input() for i in range(2)]\nH, W = map(int, a[0].split())\nh, w = map(int, a[1].split())\nprint((H-h)*(W-w))']
['Runtime Error', 'Accepted']
['s570173342', 's949159593']
[2940.0, 3060.0]
[17.0, 18.0]
[81, 110]
p03101
u277448038
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['#A - White Cells\n\nimport numpy as np\n\nH, W = map(int, input().split())\nh, w = map(int, input().split())\n\nOrig = np.ones((H, W))\nOrig[0:h, :] =0\nOrig[:, 0:w ] =0\n\ntotal = np.sum(Orig)\nprint(total)', '#A - White Cells\n\nimport numpy as np\n\nH, W = map(int, input().split())\nh, w = map(int, input().split())\n\nOrig = np.ones((H, W))\nOrig[0:h, :] =0\nOrig[:, 0:w ] =0\n\ntotal = int(np.sum(Orig))\nprint(total)']
['Wrong Answer', 'Accepted']
['s136025584', 's572339261']
[12620.0, 12508.0]
[151.0, 152.0]
[195, 200]
p03101
u282875477
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a=list(int(input(),split()))\nb=list(int(input(),split()))\n\ns=(a[0]-b[0])*(a[1]-b[1])\nprint(s)', 'a=list(int(input().split()))\nb=list(int(input().split()))\nprint(a[0]-b[0])*(a[1]-b[1])', 'a=list(int(input().split()))\nb=list(int(input().split()))\n\ns=(a[0]-b[0])*(a[0]-b[0])\nprint(s)', 'a=list(map(int,input().split()))\nb=list(map(int,input().split()))\nprint((a[0]-b[0])*(a[1]-b[1]))']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s028604576', 's352497749', 's706100840', 's805906483']
[2940.0, 2940.0, 2940.0, 2940.0]
[18.0, 17.0, 17.0, 17.0]
[93, 86, 93, 96]
p03101
u284363684
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['# input\nH, W = map(int, input().split())\nh, w = map(int, input().split())\n\n\nprint(H * W - ((H * h) + (W * w) - (h * w)))', '# input\nH, W = map(int, input().split())\nh, w = map(int, input().split())\n\n\nif (H, W) == (h, w):\n print(0)\nelse:\n print(H * W - ((H * h) + (W * w) - (h * w)))', '# input\nH, W = map(int, input().split())\nh, w = map(int, input().split())\n\n\nif (H, W) == (h, w):\n print(0)\nelse:\n print(H * W - ((W * h) + (H * w) - (h * w)))']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s382134797', 's507237031', 's862808645']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 17.0]
[127, 171, 171]
p03101
u287431190
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['hh, ww = map(int, input(),split())\nh, w = map(int, input(),split())\ns = hh*ww - h*ww - hh*w + hh*ww\nprint(s)', 'hh, ww = map(int, input(),split())\nh, w = map(int, input(),split())\n\nprint(hh*ww - h - w + 1)', 'hh,ww = map(int, input().split())\nh, w = map(int, input().split())\ns = hh*ww - h*ww - hh*w + hh*ww\nprint(s)', 'hh,ww = map(int, input().split())\nh, w = map(int, input().split())\ns = hh*ww - h*ww - hh*w + h*w\nprint(s)']
['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s566154467', 's893342454', 's907396120', 's973294405']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0, 18.0]
[108, 93, 107, 105]
p03101
u287880059
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint((h-H)*(W-w))\n \n ', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint((H-h)*(W-w))\n']
['Wrong Answer', 'Accepted']
['s640681072', 's029781916']
[2940.0, 2940.0]
[17.0, 17.0]
[102, 81]
p03101
u288601503
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['# -*- Coding: utf-8 -*-\n\nimport numpy as np\n\nINPUT=input().split( )\nInput=input().split( )\nH=int(INPUT[0])\nW=int(INPUT[1])\nh=int(Input[0])\nw=int(Input[1])\n\nmat=np.ones((H,W))\nmat[0:h,:]=0\nmat[:,0:w]=0\n\nprint(mat.sum())', '# -*- Coding: utf-8 -*-\n\nimport numpy as np\n\nINPUT=input().split()\nInput=input().split()\nH=int(INPUT[0])\nW=int(INPUT[1])\nh=int(Input[0])\nw=int(Input[1])\n\nmat=np.ones((H,W))\nmat[0:h,:]=0\nmat[:,0:w]=0\n\nprint(np.sum(mat))', '# -*- Coding: utf-8 -*-\n\nimport numpy as np\n\nH,W=int(input().split())\nh,w=int(input().split())\n\nmat=np.ones((H,W))\nmat[0:h,:]=0\nmat[:,0:w]=0\n\nprint(np.sum(mat))', '# -*- Coding: utf-8 -*-\n\nimport numpy as np\n\nINPUT=input().split()\nInput=input().split()\nH,W=int(INPUT[0]),int(INPUT[1])\nh,w=int(Input[0]),int(Input[1])\n\nmat=np.ones((H,W))\nmat[0:h,:]=0\nmat[:,0:w]=0\n\nprint(np.sum(mat))', 'import numpy as np\n\nH,W=input().split()\nh,w=input().split()\n\nmat=np.ones((H,W))\nmat[0:h,:]=0\nmat[:,0:w]=0\n\nprint(np.sum(mat))', '# -*- Coding: utf-8 -*-\n\nimport numpy as np\n\nINPUT=input().split()\nInput=input().split()\nH,W=int(INPUT[0]),int(INPUT[1])\nh,w=int(Input[0]),int(Input[1])\n\nmat=np.ones((H,W))\nmat[0:h,:]=0\nmat[:,0:w]=0\n\nprint(int(np.sum(mat)))']
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s091325580', 's267175713', 's491714892', 's551944415', 's603563632', 's915987358']
[12504.0, 12504.0, 12504.0, 12508.0, 13236.0, 13340.0]
[150.0, 150.0, 152.0, 152.0, 169.0, 167.0]
[218, 218, 160, 218, 125, 223]
p03101
u288948615
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input())\nh, w = map(int, input())\nprint((H-h)*(W-w))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h)*(W-w))\n']
['Runtime Error', 'Accepted']
['s074164735', 's848591109']
[2940.0, 2940.0]
[17.0, 17.0]
[68, 85]
p03101
u298297089
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int, input().split())\nh,w = map(int, input().split())\n\nprint(H*W-h-w+1)', 'h,w = map(int,input().split())\na,b = map(int,input().split())\nprint(h*w - a * w - b * h + a * b)']
['Wrong Answer', 'Accepted']
['s611842870', 's552217975']
[2940.0, 2940.0]
[17.0, 17.0]
[81, 96]
p03101
u302292660
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint(h*W + w*H -h*w)', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint(H*W - (h*W + w*H -h*w))']
['Wrong Answer', 'Accepted']
['s565012123', 's227253960']
[2940.0, 3060.0]
[17.0, 17.0]
[83, 91]
p03101
u303059352
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W,h,w=[map(int, input().split()) for _ in range(2)]\nprint((H-h)*(W-w))', 'a,b=[map(int, input().split()) for _ in range(2)]\nprint((a[0]-b[0])*(a[1]-b[1]))\n', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint((H-h)*(W-w))\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s351348823', 's419889882', 's969246112']
[2940.0, 2940.0, 3064.0]
[20.0, 17.0, 17.0]
[72, 81, 77]
p03101
u309457741
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input.split())\nh, w = map(int, input.split())\nprint((H-h)*(W-w))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h)*(W-w))']
['Runtime Error', 'Accepted']
['s078994114', 's136149646']
[2940.0, 2940.0]
[18.0, 17.0]
[80, 84]
p03101
u310233294
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input().split())\nh, w = map(int, input().split())\nans = H * W - h * H - w * W + h * w\nprint(ans)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nans = H * W - h * W - w * H + h * w\nprint(ans)']
['Wrong Answer', 'Accepted']
['s330391963', 's181622863']
[2940.0, 2940.0]
[17.0, 17.0]
[112, 112]
p03101
u311669106
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-h*H-w*W+h*w)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint((H-h)*(W-w))']
['Wrong Answer', 'Accepted']
['s807710061', 's219816419']
[2940.0, 2940.0]
[17.0, 17.0]
[80, 76]
p03101
u314050667
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['n, k = map(int, input().split())\ns = input()\n\nprint(s[:k-1] + s[k-1].lower() + s[k:n])', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((H - h) * (W - w))']
['Runtime Error', 'Accepted']
['s764152765', 's101688849']
[2940.0, 2940.0]
[17.0, 17.0]
[86, 91]
p03101
u327532412
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H*W - h*w)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H*W - (h*W + w*H))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H * W - (h * W + w * H) + h * w)\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s406137906', 's749819664', 's813446290']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[82, 90, 105]
p03101
u329143273
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-(W*h)+((H*w)-(h*w)))', 'H,W=int(input())\nh,w=int(input())\nprint(H*W-(W*h)+((H*w)-(h*w)))', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-((W*h)+((H*w)-(h*w))))']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s208887980', 's421862837', 's369277978']
[2940.0, 3316.0, 2940.0]
[17.0, 21.0, 17.0]
[88, 64, 90]
p03101
u331464808
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a,b = map(int,input().split())\nc,d = map(int,input().split())\nprint(a*b-c*d-d*c+c*d)', 'a,b = map(int,input().split())\nc,d = map(int,input().split())\nprint(a*b-c-d+c*d)', 'a,b = map(int,input().split())\nc,d = map(int,input().split())\nprint(a*b-c-d+1)', 'a,b = map(int,input().split())\nc,d = map(int,input().split())\nprint(a*b-c-d+cd)', 'a,b = map(int,input().split())\nc,d = map(int,input().split())\nprint(a*b-c*b-d*a+c*d)']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s241349248', 's668919685', 's736016862', 's910557895', 's039889940']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0, 18.0]
[84, 80, 78, 79, 84]
p03101
u331606500
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W,h,w=map(int,open(0));print((H-h)*(W-w))', 'H,W,h,w=map(int,open(0).read().split());print((H-h)*(W-w))']
['Runtime Error', 'Accepted']
['s279703791', 's790027577']
[2940.0, 2940.0]
[17.0, 17.0]
[43, 58]
p03101
u334535590
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = [int(_) for _ in input().split()]\nh, w = [int(_) for _ in input().split()]\nprint(H*W-h*w)', 'H, W = [int(_) for _ in input().split()]\nh, w = [int(_) for _ in input().split()]\nprint((H-h)*(W-w))\n']
['Wrong Answer', 'Accepted']
['s583493364', 's121286124']
[2940.0, 2940.0]
[18.0, 17.0]
[96, 101]
p03101
u338208364
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = list(map(int,input().split()))\nh,w = list(map(int,input().split()))\nprint(H,W,h,w)\nans = h*W + w*H - h*w\nprint(H*W-ans)', 'H,W = list(map(int,input().split()))\nh,w = list(map(int,input().split()))\n#print(H,W,h,w)\nans = h*W + w*H - h*w\nprint(H*W-ans)']
['Wrong Answer', 'Accepted']
['s746531649', 's597024621']
[2940.0, 2940.0]
[17.0, 17.0]
[125, 126]
p03101
u339550873
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['K,w = [int(x) for x in input().split()]\nh,w = [int(x) for x in input().split()]\nprint (K*W -(K-h)*(W-w))', 'K,W = [int(x) for x in input().split()]\nh,w = [int(x) for x in input().split()]\nprint (K*W -(K-h)*(W-w))', 'K,W = [int(x) for x in input().split()]\nh,w = [int(x) for x in input().split()]\nprint (K*W -(K-w)*(W-h))', 'K,W = [int(x) for x in input().split()]\nh,w = [int(x) for x in input().split()]\nprint (K*W -(K-h)*(W-w))', 'K,W = [int(x) for x in input().split()]\nh,w = [int(x) for x in input().split()]\nprint ((K-h)*(W-w))']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s023847243', 's136082341', 's954702041', 's968636064', 's402566894']
[2940.0, 2940.0, 2940.0, 2940.0, 3064.0]
[17.0, 17.0, 18.0, 17.0, 17.0]
[104, 104, 104, 104, 99]
p03101
u339922532
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((H * W) - (h * H + w * W - h * w)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((H * W) - (h * H + w * W - h * w))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((H * W) - (h * W + w * H - h * w))']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s470532606', 's473643584', 's248976232']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 19.0]
[106, 107, 107]
p03101
u340318466
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a, b = map(int, input().split())\nc, d = map(int, input().split())\nif (a*b)==(c*d):\n print((a*b)-(c*d))\nelse if (a*b) > (c*d):\n print(c*d)', 'a, b = map(int, input().split())\nc, d = map(int, input().split())\nif (a*b)==(c*d):\n print((a*b)-(c*d))\nelse if (a*b) > (c*d):\n print((c*d))', 'a, b = map(int, input().split())\nc, d = map(int, input().split())\nif (a*b)==(c*d):\n print((a*b)-(c*d))\nelse if (a*b ) > (c*d):\n print((c*d))', 'a, b = map(int, input().split())\nc, d = map(int, input().split())\n[print("0") if (a*b)=(c*d) else print(c*d)]', 'a, b = map(int, input().split())\nc, d = map(int, input().split())\nif (a*b)==(c*d):\n print("0")\nelse if (a*b ) > (c*d):\n print(c*d)', 'a, b = map(int, input().split())\nc, d = map(int, input().split())\n[print("0") if (a*b)==(c*d) else print(c*d)]', 'a, b = map(int, input().split())\nc, d = map(int, input().split())\nif (a*b)==(c*d):\n print((a*b)-(c*d))\nelseif (a*b ) > (c*d):\n print((c*d))', ' a, b = map(int, input().split())\n c, d = map(int, input().split())\n if (a*b)==(c*d):\n print((a*b)-(c*d))\n elif (a*b) > (c*d):\n print(c*d)', 'a, b = map(int, input().split())\nc, d = map(int, input().split())\nprint((a-c)*(b-d))']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']
['s005602501', 's258800965', 's594449185', 's672807515', 's840482612', 's869296970', 's919502372', 's997590300', 's779962884']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 18.0, 18.0, 18.0, 18.0, 18.0, 17.0, 18.0, 17.0]
[137, 139, 141, 109, 131, 110, 140, 158, 84]
p03101
u342051078
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H = int(input())\nW = int(input())\nh = int(input())\nw = int(input())\ntate = H-h\nyoko = W-w\nprint(tate*yoko)', 'H = int(input())\nW = int(input())\nh = int(input())\nw = int(input())\nprint((H-h)*(W-w))', 'H = input()\nW = input()\nh = input()\nw = input()\ntate = H-h\nyoko = W-w\nprint(tate*yoko)', 'import numpy as np\nH,W = map(int, input().split())\nh,w = map(int, input().split())\nprint((H-h)*(W-w))']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s751077617', 's783380429', 's964570229', 's779051665']
[2940.0, 2940.0, 2940.0, 12500.0]
[17.0, 18.0, 17.0, 148.0]
[106, 86, 86, 101]
p03101
u344276999
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['HW = list(map(int, input().split))\nhw = list(map(int, input().split))\n\nprint(HW[0]*HW[1] - hw[0]*HW[1] - HW[0]*hw[1] + hw[0]*hw[1])', 'HW = list(map(int, input().split()))\nhw = list(map(int, input().split()))\n \nprint(HW[0]*HW[1] - hw[0]*HW[1] - HW[0]*hw[1] + hw[0]*hw[1])']
['Runtime Error', 'Accepted']
['s734268946', 's843896174']
[2940.0, 3060.0]
[17.0, 17.0]
[131, 136]
p03101
u345483150
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['h, w=map(int, input().split())\nH, W=map(int, input().split())\nprint(H*W-h*w)', 'h, w, H, W=map(int, input().split())\nprint(h*W+w*H-w*h)', 'h, w=map(int, input().split())\nH, W=map(int, input().split())\nprint((H-h)*(W*w))', 'h, w=map(int, input().split())\nH, W=map(int, input().split())\n\nprint((H-h)*(W-w))']
['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s281703940', 's338502906', 's903346719', 's082470164']
[2940.0, 2940.0, 2940.0, 3060.0]
[17.0, 17.0, 18.0, 19.0]
[76, 55, 80, 81]
p03101
u347920118
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a,b = map(int,input().split())\n\nh,w = map(int,input().split())\n\nprint(a*b-h*w)\n', 'a,b = map(int,input().split())\n\nh,w = map(int,input().split())\n\nprint((a-h)*(b-w))\n']
['Wrong Answer', 'Accepted']
['s759946627', 's981986927']
[2940.0, 2940.0]
[18.0, 17.0]
[79, 83]
p03101
u348285568
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['n,m=map(int,input().split())\nlst=[list(map(int,input().split()))]\nfor i in range(n-1):\n a=list(map(int,input().split()))\n x=0\n for j in range(len(lst)):\n if x > m :break\n if lst[j][0] > a[0]:\n lst.insert(j,a)\n break\n x+=lst[j][1]\n \nans=0\nnum=0\nfor i in lst:\n if i[1]+num>=m:\n ans+=i[0]*(m-num)\n break\n ans+=i[0]*i[1]\n num+=i[1]\nprint(ans)', 'n,m=map(int,input().split())\nlst=[list(map(int,input().split()))]\nfor i in range(n-1):\n a=list(map(int,input().split()))\n x=0\n for j in range(len(lst)):\n if x > m :break\n if lst[j][0] > a[0]:\n lst.insert(j,a)\n break\n x+=lst[j][1]\n \nans=0\nnum=0\nfor i in lst:\n if i[1]+num>=m:\n ans+=i[0]*(m-num)\n break\n ans+=i[0]*i[1]\n num+=i[1]\nprint(ans,lst)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W-H*w-h*W+h*w)']
['Runtime Error', 'Runtime Error', 'Accepted']
['s531180229', 's828757989', 's792388275']
[3064.0, 3064.0, 2940.0]
[18.0, 17.0, 17.0]
[420, 424, 80]
p03101
u355154595
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a,b=map(int,input().split())\nc,d=map(int,input().split())\nprint(int(((a-c)*(b-d)))', 'a,b=map(int,input().split())\nc,d=map(int,input().split())\nprint(int((a-c)*(b-d)))\n']
['Runtime Error', 'Accepted']
['s887606270', 's444928209']
[2940.0, 2940.0]
[17.0, 17.0]
[82, 82]
p03101
u357751375
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int,input().split())\nh,w = map(int,input().split())\n\nA = H * W \nA = A - (h * H) \nA = A - ((W - h) * w) \n\nprint(A)\n', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\n\nA = H * W \nA = A - (h * W) \nA = A - ((H - h) * w) \n\nprint(A)\n']
['Wrong Answer', 'Accepted']
['s441694567', 's567311527']
[3064.0, 2940.0]
[18.0, 17.0]
[169, 169]
p03101
u363466395
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['n,m = [int(x) for x in input().split()]\nl = [list(map(int,input().split())) for _ in range(n)]\nl.sort()\ncost = 0\nfor x in range(n):\n if m == 0:\n exit()\n if l[x][1] <= m:\n cost += l[x][0]*l[x][1]\n else:\n cost += l[x][0]*m\n m -= l[x][1]\nprint(cost)', 'H,W = [int(x) for x in input().split()]\nh,w = [int(x) for x in input().split()]\nprint((H-h)*(W-w))']
['Runtime Error', 'Accepted']
['s358457894', 's402551414']
[3064.0, 2940.0]
[17.0, 17.0]
[279, 98]
p03101
u366482170
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W - h*w - w*H + h*w)\n', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*W - h*W - w*H + h*w)']
['Wrong Answer', 'Accepted']
['s365644247', 's677489094']
[2940.0, 2940.0]
[18.0, 17.0]
[87, 86]
p03101
u366959492
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['s=(H-h)*(W-w)\nprint(s)\n', 'int(input(H,W,h,w))\n\ns=(H-h)*(W-w)\nprint(s)\n', 'int(input(H W h w))\n\ns=(H-h)*(W-w)\nprint(s)\n', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\n\nprint((H-h)*(W-w))\n']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s127475351', 's329363090', 's363588758', 's606140197']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[23, 44, 44, 78]
p03101
u367130284
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['a,b=map(int,input().split())\nc,d=map(int,input().split())\nprint(a*b-c*d)', 'a,b=map(int,input().split())\nc,d=map(int,input().split())\nprint((a-c)*(b-d))']
['Wrong Answer', 'Accepted']
['s493262872', 's085998243']
[3316.0, 2940.0]
[25.0, 17.0]
[72, 76]
p03101
u371467115
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nA=[list(map(int,input().split())) for _ in range(N)]\ncnt=0\nfor a in A:\n ans=C\n for i in range(M):\n ans+=a[i]*B[i]\n if ans>0:\n cnt+=1\nprint(cnt)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint((H-h)*(W-w))']
['Runtime Error', 'Accepted']
['s404273096', 's007344714']
[3060.0, 2940.0]
[17.0, 17.0]
[216, 76]
p03101
u371530330
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int, input().split())\nh,w = map(int, input().split())\n\nprint(H*W -(h+w-h*w))', 'H,W = map(int, input().split())\nh,w = map(int, input().split())\n \nprint(H*W -(h*W+H*w-h*w))']
['Wrong Answer', 'Accepted']
['s555190919', 's979842123']
[2940.0, 2940.0]
[17.0, 17.0]
[86, 91]
p03101
u374051158
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = [list(map(int, input().split())) for _ in range(N)]\n\ncnt = 0\n\nfor a in A:\n \n if(sum([ta * tb for ta, tb in zip(a, B)]) + C > 0):\n cnt += 1\n\nprint(cnt)', 'h, w = map(int, input().split())\na, b = map(int, input().split())\nprint((h-a) * (w-b))']
['Runtime Error', 'Accepted']
['s913094298', 's803564389']
[3060.0, 2940.0]
[18.0, 18.0]
[239, 86]
p03101
u374146618
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = [int(x) for x in input().split()]\nh, w = [int(x) for x in input().split()]\n\nprint(H*W - h*w)', 'H, W = [int(x) for x in input().split()]\nh, w = [int(x) for x in input().split()]\nprint((H-h)*(W-w))\n']
['Wrong Answer', 'Accepted']
['s091083685', 's001585365']
[2940.0, 2940.0]
[19.0, 17.0]
[99, 101]
p03101
u375282392
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input())\nh,w=map(int,input())\nprint((H-h)*(W-w))', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint((H-h)*(W-w))']
['Runtime Error', 'Accepted']
['s637005836', 's667863963']
[2940.0, 2940.0]
[17.0, 17.0]
[60, 76]
p03101
u377036395
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int,input().split())\nh,w = map(int,input().split())\n\ntotal = H*W\nline = (H - h) * W\nprint(total - line)', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\n \ntotal = H*W\nline = (H - h) * w\nprint(total - line)', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\n \nprint((H-h)*(W-w))']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s190046715', 's466892805', 's658560179']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[113, 114, 82]
p03101
u377989038
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['import sys\ninput = sys.stdin.readline\n\ndef main():\n n, m, c = map(int, input().split())\n b = list(map(int, input().split()))\n a = [list(map(int, input().split())) for i in range(n)]\n\n ans = 0\n for i in a:\n cnt = c\n for j in range(m):\n cnt += i[j] * b[j]\n \n if cnt > 0:\n ans += 1\n print(ans)\n\nif __name__ == "__main__":\n main()', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n \nprint(H * W - H * w - W * h + h * w)']
['Runtime Error', 'Accepted']
['s261197035', 's807091339']
[3064.0, 2940.0]
[17.0, 17.0]
[397, 108]
p03101
u393881437
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['N, M, C = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncount = 0\n\nfor i in range(N):\n a = list(map(int, input().split()))\n add = 0\n for j in range(M):\n add += a[j] * b[j]\n\n if add + C > 0:\n count += 1\n\nprint(count)\n', 'h, w = list(map(int, input().split()))\ndh, dw = list(map(int, input().split()))\n\nprint((h-dh) * (w-dw))\n']
['Runtime Error', 'Accepted']
['s404119935', 's107174412']
[3060.0, 2940.0]
[17.0, 17.0]
[264, 104]
p03101
u396391104
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int(input().split()))\nh, w = map(int(input().split()))\nprint((H-h)*(W-w))', 'H, W = map(int,input().split())\nh, w = map(int,input().split())\nprint((H-h)*(W-w))\n']
['Runtime Error', 'Accepted']
['s006023222', 's443496790']
[2940.0, 2940.0]
[17.0, 17.0]
[84, 83]
p03101
u396971285
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input().split())\nh, w = map(int, input().split())\n\na=H*W\nb=h*w\n\nprint(a-b)\n\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\na=H*W\nb=h*w\n\nprint((a+h*W+H*w)-b)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\na=H*W\nb=h*w\n\nprint(a+h*W+H*W-b)\n\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\na=H*W\nb=h*w\n\nprint(a-h*W-H*w+b)\n']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s036704824', 's073114888', 's964423549', 's216776143']
[2940.0, 2940.0, 2940.0, 3060.0]
[17.0, 17.0, 17.0, 20.0]
[92, 100, 100, 99]
p03101
u398211442
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W,h,w = (int(i) for i in input().split())\nprint((H-W)*(h-w))\n', 'H,W, = (int(i) for i in input().split())\nh,w = (int(i) for i in input().split())\nprint((H-h)*(W-w))']
['Runtime Error', 'Accepted']
['s672059671', 's999571757']
[2940.0, 2940.0]
[17.0, 17.0]
[63, 99]
p03101
u398846051
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint(h*W+w*H-h*w)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H*W-(h*W+w*H-h*w))']
['Wrong Answer', 'Accepted']
['s827358962', 's031328835']
[2940.0, 2940.0]
[18.0, 17.0]
[84, 90]
p03101
u398983698
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['X,Y=map(int(input(),split())\nx,y=map(int(input(),split())\na=(X-x)*(Y-y)\nprint(a)', 'X,Y=map(int,input().split())\nx,y=map(int,input().split())\na=(X-x)*(Y-y)\nprint(a)']
['Runtime Error', 'Accepted']
['s039581789', 's961538350']
[2940.0, 2940.0]
[17.0, 17.0]
[80, 80]
p03101
u400221789
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,inout(),split())\nh,w=map(int,inout().split())\nall=H*W\nblack=h*w+H*w-h*w\nwhite=all-black\npurint(white)', 'H,W=map(int,input(),split())\nh,w=map(int,input().split())\nmath=H*W\nblack=h*w+H*w-h*w\nwhite=math-black\nprint(white)\n', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nmath=H*W\nblack=h*W+H*w-h*w\nwhite=math-black\nprint(white)\n\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s442758445', 's913252933', 's626627478']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[113, 115, 116]
p03101
u403436880
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = map(int, input().split())\nh.w = map(int, input().split())\nprint(H*W -h*W-w*H+h*w)', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint(H*W-h*W-w*H+w*h)']
['Runtime Error', 'Accepted']
['s426834504', 's386605298']
[9076.0, 9160.0]
[24.0, 26.0]
[87, 84]
p03101
u403984573
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['A,B=map(int,input().split())\nC,D=map(int,input().split())\nprint((A-1)*(B-1)-(C-1)*(D-1))', 'A,B=map(int,input().split())\nC,D=map(int,input().split())\nprint(A*B-D*A-B*C+D*C)']
['Wrong Answer', 'Accepted']
['s738749896', 's268350464']
[2940.0, 2940.0]
[17.0, 17.0]
[88, 80]
p03101
u404678206
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input(),split())\nh,w=map(int,input(),split())\nprint((H-h)*(W-w))', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint((H-h)*(W-w))\n\n\n']
['Runtime Error', 'Accepted']
['s045544901', 's498701870']
[2940.0, 2940.0]
[17.0, 17.0]
[76, 79]
p03101
u406158207
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H=int(input())\nW=int(input())\nh=int(input())\nw=int(input())\nprint((H-h)*(W-w))', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nX=H-h\nY=W-w\nZ=X*Y\nprint(Z)']
['Runtime Error', 'Accepted']
['s055453834', 's216490664']
[2940.0, 2940.0]
[17.0, 17.0]
[78, 84]
p03101
u412481017
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W=map(int,input().split())\nh,w=map(int,input().split())\n\nprint(H*w+W*h-h*w)', 'H,W=map(int,input())\nh,w=map(int,input())\n\nprint(H*w+W*h-h*w)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\n\nprint(H*W-(H*w+W*h-h*w))']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s534788327', 's971865732', 's936777194']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0]
[77, 61, 83]
p03101
u414425367
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['from math import *\nnum_digit = lambda n: int(log2(n)+1) \nA, B = [int(s) for s in input().split()]\n\nret = 0\nN = (B-A)+1\nnd = num_digit(B)\nfor i in range(nd):\n nb = int(pow(2, i+1) if i>0 else pow(2, i+2))\n nr = N%nb\n s = sum([(A+j) >> i for j in range(nr)])\n ret += ((s%2) << i)\n \nprint(ret)', 'from math import log2\nnum_digit = lambda n: int(log2(n)+1) \n\ndef to_digits(num, nd):\n rest = num\n ret = []\n for i in list(range(nd))[::-1]:\n d = pow(2, i)\n n = int(rest/d)\n rest = rest - d*n\n ret.append(n)\n return ret\n\ndef to_num(digits):\n nd = len(digits)\n ret = 0\n for dig, i in zip(digits, list(range(nd))[::-1]):\n d = int(pow(2, i))\n ret += dig*d\n return ret\n\ndef solve(A, B):\n nd = num_digit(B)\n digitss = [to_digits(n, nd) for n in range(A, B+1)]\n return to_num([digits.count(1) %2 for digits in zip(*digitss)])\n \nA, B = [int(s) for s in input().split()]\nprint(solve(A, B))', 'H, W = [int(s) for s in input().split()]\nh, w = [int(s) for s in input().split()]\nprint((H-h)*(W-w))']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s315988061', 's438774212', 's960412385']
[3188.0, 3064.0, 2940.0]
[20.0, 18.0, 17.0]
[308, 658, 100]
p03101
u426572476
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H,W = input().split()\nh, w = input().split()\nprint(H * W - (h * W + w * H - h * w))', 'H,W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H * W - (h * W + w * H - h * w))']
['Runtime Error', 'Accepted']
['s895669441', 's411497553']
[2940.0, 2940.0]
[17.0, 18.0]
[83, 103]
p03101
u430414424
2,000
1,048,576
There are H rows and W columns of white square cells. You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns. How many white cells will remain? It can be proved that this count does not depend on what rows and columns are chosen.
['H, W = map(int,input().split())\nh,w = map(int,input().split())\n\nprint(H*W - H*h - (H-h)*w)', 'H,W = map(int, input().split())\nh,w = map(int, input().split())\n\nprint(H*W - W*h - (H-h)*w)']
['Wrong Answer', 'Accepted']
['s024420441', 's157390531']
[2940.0, 2940.0]
[17.0, 18.0]
[90, 91]