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 | u739721456 | 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=input()\nhw=input()\nHWlist=HW.split()\nhwlist=hw.split()\nprint(HWlist)\nprint(hwlist)\nH=int(HWlist[0])\nW=int(HWlist[1])\nh=int(hwlist[0])\nw=int(hwlist[1])\nprint(H*W-h*W-H*w+h*w)', 'H, W = map(int, input().split())\na, b = map(int, input().split())\nprint(H*W-H*b-W*a+a*b)\n'] | ['Wrong Answer', 'Accepted'] | ['s430189453', 's118919742'] | [3060.0, 9152.0] | [17.0, 29.0] | [176, 89] |
p03101 | u740047492 | 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'] | ['s090753860', 's631167532'] | [2940.0, 2940.0] | [17.0, 17.0] | [76, 76] |
p03101 | u745554846 | 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 = [int(i) for i in input().split()]\nc, d = [int(i) for i in input().split()]\n\nprint(a*b - c*d)', 'a, b = [int(i) for i in input().split()]\nc, d = [int(i) for i in input().split()]\n\nprint((a-c)*(b-d))'] | ['Wrong Answer', 'Accepted'] | ['s647306703', 's412204862'] | [2940.0, 3060.0] | [17.0, 17.0] | [99, 101] |
p03101 | u745562158 | 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))'] | ['Runtime Error', 'Accepted'] | ['s944620662', 's835760529'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 89] |
p03101 | u746428948 | 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-w))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h) * (W-w))'] | ['Wrong Answer', 'Accepted'] | ['s710873674', 's471480201'] | [9100.0, 9136.0] | [28.0, 26.0] | [86, 86] |
p03101 | u747873993 | 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. | ['"""White Cells"""\nH,W=(int(i) for i in input().split())\nh,w=(int(i) for i in input().split())\nH*W-H*w-W*h+h*w', '"""White Cells"""\nH,W=(int(i) for i in input().split())\nh,w=(int(i) for i in input().split())\nprint(H*W-H*w-W*h+h*w)'] | ['Wrong Answer', 'Accepted'] | ['s549203974', 's472587779'] | [2940.0, 2940.0] | [17.0, 18.0] | [109, 116] |
p03101 | u748311048 | 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. | ['print((H-h)*(W-w))', 'H,W=map(int, input().split())\nh,w=map(int, input().split())\nprint((H-h)*(W-w))'] | ['Runtime Error', 'Accepted'] | ['s578144290', 's595671096'] | [2940.0, 2940.0] | [17.0, 17.0] | [18, 78] |
p03101 | u754022296 | 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-w))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h)*(W-w))'] | ['Wrong Answer', 'Accepted'] | ['s677870329', 's454598106'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 84] |
p03101 | u754511616 | 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=list(map(int,input().split()))\nc,d=list(map(int,input().split()))\nx=a*b\nprint(x-a*c-b*d)', 'a,b=list(map(int,input().split()))\nc,d=list(map(int,input().split()))\nx=a*b\nprint(x-a*c-b*d+c*d)', 'a,b=list(map(int,input().split()))\nc,d=list(map(int,input().split()))\nx=a*b\nprint(x-a*c-b*)', 'a,b=list(map(int,input().split()))\nc,d=list(map(int,input().split()))\nx=a*b\nprint(x-a*d-b*c+c*d)\n'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s058580180', 's625400229', 's909093375', 's960752866'] | [8988.0, 9160.0, 8860.0, 9096.0] | [28.0, 33.0, 25.0, 31.0] | [92, 96, 91, 97] |
p03101 | u755545520 | 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())\nX=(H-h)*(W-w)\nprint(x)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nX=(H-h)*(W-w)\nprint(X)'] | ['Runtime Error', 'Accepted'] | ['s775257292', 's228477402'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 80] |
p03101 | u763172774 | 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 = input().split()\nb = input().split()\nc = a[0] * b[1]\nd = a[1] * b[0]\nprint(a[0] * a[1] - (c + d - b[0] * b[1]))', 'a = int(input().split())\nb = int(input().split())\nc = a[0] * b[1]\nd = a[1] * b[0]\nprint(a[0] * a[1] - (c + d - b[0] * b[1]))', 'a = input().split()\nb = input().split()\na = list(map(int, a))\nb = list(map(int, b))\nc = a[0] * b[1]\nd = a[1] * b[0]\nprint(a[0] * a[1] - (c + d - b[0] * b[1]))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s249031031', 's269874549', 's164625044'] | [2940.0, 3060.0, 3060.0] | [18.0, 18.0, 20.0] | [114, 124, 158] |
p03101 | u765590009 | 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())\n \nl = []\nfor i in range(n):\n l.append(input())\n\nif len(set(l)) != n :\n print("No")\n exit()\n\nfor i in range(n-1) :\n if l[i][-1] != l[i+1][0]:\n print("No")\n exit()\n\nprint("Yes")', 'hh, ww = map(int, input().split())\nh, w = map(int, input().split())\n\nprint(int((hh-h)*(ww-w)))'] | ['Runtime Error', 'Accepted'] | ['s767166420', 's284772634'] | [3060.0, 2940.0] | [17.0, 17.0] | [218, 94] |
p03101 | u767032306 | 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())\n\nprint((a * b) - (a * c) - (b * d) + (c * d))', 'a, b = map(int, input().split())\nc, d = map(int, input().split())\n\nprint((a * b) - (a * d) - (b * c) + (c * d))'] | ['Wrong Answer', 'Accepted'] | ['s297817919', 's967416946'] | [2940.0, 2940.0] | [17.0, 17.0] | [111, 111] |
p03101 | u772371451 | 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 =[list(map(int,input().split())) for i in range(2)]\nprint(HW_list[0][0]*HW_list[0][1]-HW_list[1][0]*HW_list[1][1])', 'HW =[list(map(int,input().split())) for i in range(2)]\nprint((HW[0][0]-HW[1][0])*(HW[0][1]-HW[1][1])', 'HW =[list(map(int,input().split())) for i in range(2)]\nprint((HW[0][0]-HW[1][0])*(HW[0][1]-HW[1][1]))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s529626236', 's709483599', 's233463572'] | [9020.0, 8988.0, 9148.0] | [27.0, 23.0, 28.0] | [122, 100, 101] |
p03101 | u774985302 | 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,m =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)', 'H,W =map(int,input().split())\nh,m =map(int,input().split())\nprint(H*W-h*W-w*H+h*W)', 'H,W =map(int,input().split())\nh,m =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)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s254280837', 's309463172', 's659567922', 's676972017', 's979683553'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [82, 82, 82, 83, 82] |
p03101 | u777078967 | 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. | ['data = input().rstrip().split()\nmat=[[1 for i in range(int(data[1]))] for j in range(int(data[0]))]\nn = input().rstrip().split()\nprint(mat)\nfor i2 in range(int(n[0])):\n for k in range(int(data[1])):\n mat[i2][k]=0\nprint(mat)\nfor j2 in range(int(n[1])):\n for k in range(int(data[0])):\n mat[k][j2]=0\nans=0\nfor l in range(len(mat)):\n ans+=sum(mat[l])\nprint(ans)', 'data = input().rstrip().split()\nmat=[[1 for i in range(int(data[1]))] for j in range(int(data[0]))]\nn = input().rstrip().split()\n#print(mat)\nfor i2 in range(int(n[0])):\n for k in range(int(data[1])):\n mat[i2][k]=0\n#print(mat)\nfor j2 in range(int(n[1])):\n for k in range(int(data[0])):\n mat[k][j2]=0\nans=0\nfor l in range(len(mat)):\n ans+=sum(mat[l])\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s496948724', 's458580340'] | [3064.0, 3064.0] | [18.0, 17.0] | [366, 368] |
p03101 | u780698286 | 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 = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h) * (W-w))\n'] | ['Wrong Answer', 'Accepted'] | ['s790573467', 's616593631'] | [8876.0, 9116.0] | [27.0, 28.0] | [98, 87] |
p03101 | u790812284 | 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()))\ntmp=0\ncnt=0\na_i=[]\nfor _ in range(n):\n a=list(map(int, input().split()))\n for i in range(m):\n tmp=0\n tmp+=int(a[i])*int(b[i])\n if tmp+c>0:\n cnt+=1\n \nprint(cnt)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint(H*W-(h*W+H*w-h*w))'] | ['Runtime Error', 'Accepted'] | ['s750558430', 's019183908'] | [3064.0, 2940.0] | [17.0, 17.0] | [262, 91] |
p03101 | u797016134 | 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. | ['uh, uw = map(int, input().split())\nh, w = map(int, input().split())\nprint(int((uh*uw) - (uh*h) - (uw*w) + (h*w)))', 'uh, uw = map(int, input().split())\nh, w = map(int, input().split())\nprint((uh*uw) - (uh*h) - (uw*w) + (h*w))', 'uh,uw = map(int, input().split())\nh, w = map(int, input().split())\nprint((uh-h)*(uw-w))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s086044880', 's711214205', 's296113926'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [113, 108, 87] |
p03101 | u798557584 | 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. | ['# abc121_a\nH, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h)*(W-w)9\n', '\n\nH,W = map(int,input().split())\nh,w = map(int,input().split())\nprint((H-h)*(W-w))\n\n\n\n\n\n'] | ['Runtime Error', 'Accepted'] | ['s556807938', 's220863685'] | [2940.0, 2940.0] | [17.0, 17.0] | [96, 88] |
p03101 | u800441570 | 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)\nans = (int(H) - int(h)) * (int(W) - int(w))\nprint(ans)\n', 'H, W = input().split()\nh, w = input().split()\nans = (int(H) - int(h)) * (int(W) - int(w))\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s916344587', 's084450648'] | [2940.0, 2940.0] | [17.0, 18.0] | [119, 101] |
p03101 | u804048521 | 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(int(H*W-h-w+h*w))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint(H*W-h*W-w*H+w*h)'] | ['Wrong Answer', 'Accepted'] | ['s618629681', 's768251360'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 89] |
p03101 | u807070737 | 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().spplit(" ")\n\nprint((H-h) * (W-w))', 'H,W = map(int,input().split(" "))\nh,w = map(int,input().split(" "))\n\nprint((H-h)*(W-w))'] | ['Runtime Error', 'Accepted'] | ['s860331979', 's498252730'] | [2940.0, 2940.0] | [18.0, 17.0] | [72, 87] |
p03101 | u807889603 | 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\nN, M, C= map(int, input().split())\nB = []\nB.append(list(map(int, input().split())))\narrB = np.array(B)\n#A = np.array()\n\n# A[i] = input()\n\n\n#a = list()\n\n# a.append(map(int, input().split()))\n\n#a = list(a)\n\nA = []\nfor i in range(N):\n A.append(list(map(int, input().split())))\n\narrA = np.array(A)\n\nD = np.empty((0,M), int)\nfor i in range(N):\n D = np.append(D, arrB*arrA[i], axis=0)\n# C.append(arrB*arrA[i])\n\n\nF = np.empty((0,N), int)\nfor i in range(N):\n F = np.append(F, np.sum(D[i]))\n\nE = F + C\nt=0\nfor i in range(N):\n if E[i]>0:\n t = t+1\n else:\n t =t\n\n\n\n\n#print(arrA)\n#print(D)\n#print(E)\n#print(F)\nprint(t)\n', 'H, W= map(int, input().split())\nh, w= map(int, input().split())\n\nA = h * W\nB = H * w\nprint(A + B - h*w)\n', 'H, W= map(int, input().split())\nh, w= map(int, input().split())\n\nA = h * W\nB = H * w\n\na = H * W - (A + B - h * w)\nprint(a)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s228269365', 's686512744', 's889164238'] | [12512.0, 2940.0, 2940.0] | [148.0, 17.0, 17.0] | [713, 104, 123] |
p03101 | u814781830 | 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\nH, W = map(int, input().split())\nh, w = map(int, input().split())\n\ntable = np.array(np.ones((H, W)))\ntable[:h] = 0\ntable[:,:w] = 0\nprint(np.sum(table))', 'import numpy as np\n\nH, W = map(int, input().split())\nh, w = map(int, input().split())\n\ntable = np.array(np.ones((H, W)))\ntable[:h] = 0\ntable[:,:w] = 0\nprint(int(np.sum(table)))'] | ['Wrong Answer', 'Accepted'] | ['s224336507', 's077913773'] | [12424.0, 12424.0] | [149.0, 150.0] | [171, 176] |
p03101 | u815659544 | 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. | ['num_shops, target_drinks = map(int, input().split())\nsell = {}\n\nfor _ in range(num_shops):\n a,b = map(int, input().split())\n\n try:\n sell[a] += b\n except:\n sell[a] = b\n\nans, bought = 0, 0\n\nfor price in sorted(sell):\n\n selling = sell[price]\n\n if bought + selling < target_drinks:\n ans += price * selling \n bought += selling\n else:\n ans += price * (target_drinks - bought)\n break\n\nprint(ans)\n', 'H, W = map(int, input().split())\n\nh, w = map(int, input().split())\n\ntot = H * W\n\nrows = h * W\ncols = H * w\ncommon = h * w\n\nprint(tot - rows - cols + common)'] | ['Runtime Error', 'Accepted'] | ['s825313463', 's565314628'] | [3060.0, 3060.0] | [17.0, 17.0] | [452, 156] |
p03101 | u816878803 | 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. | ['W,H=map(int,input())\nw,h=map(int,input())\nprint(W*H-(h*W+w*H-w*h))', 'W,H=map(int,input().split())\nw,h=map(int,input().split())\nprint((W-w)*(H-h))\n'] | ['Runtime Error', 'Accepted'] | ['s960737303', 's154433204'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 77] |
p03101 | u817692975 | 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()))\nb = list(map(int, input().split()))\nH = a[0]\nW = a[1]\nh = b[0]\nw = b[1]\nk = H * h - W * w\nprint(k)', 'a = list(map(int, input().split()))\nb = list(map(int, input().split()))\nH = a[0]\nW = a[1]\nh = b[0]\nw = b[1]\nk = (H - h) * (W - w)\nprint(k)\n'] | ['Wrong Answer', 'Accepted'] | ['s179195454', 's027752572'] | [2940.0, 3060.0] | [17.0, 17.0] | [134, 139] |
p03101 | u818724291 | 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 = mao(int, input().split())\n\nprint(W*h + H*w -(h+w-1))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint(H*W - W*h - H*w + h*w)'] | ['Runtime Error', 'Accepted'] | ['s503692344', 's125700251'] | [2940.0, 2940.0] | [17.0, 17.0] | [92, 95] |
p03101 | u820047642 | 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())\nl=[]\nldi=[]\nans=""\n\na=A\nwhile a<=B:\n l.append(format(a, \'b\'))\n a+=1\n\ni=0\nwhile i<=B-A:\n ldi.append(l[i].zfill(len(format(B, \'b\'))))\n i+=1\n\nj=0\nwhile j<=len(format(B, \'b\'))-1:\n k=0\n p=0\n while k<=B-A:\n if ldi[k][j]=="1":\n p+=1\n else:\n pass\n k+=1\n if p%2==1:\n ans=ans+"1"\n else:\n ans=ans+"0"\n j+=1\n\nprint(int(ans, 2))', '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'] | ['s355663668', 's414760515'] | [3192.0, 2940.0] | [18.0, 17.0] | [431, 81] |
p03101 | u823885866 | 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\nimport numpy as np\nrm = lambda: map(int, sys.stdin.readline().split())\nrl = lambda: list(map(int, sys.stdin.readline().split()))\n\nn, m, c = rm()\nb = np.array(rl())\ncnt = 0\nfor _ in range(n):\n a = np.array(rl())\n if np.sum(a*b) > -c:\n cnt += 1\nprint(cnt)', 'import sys\nrm = lambda: map(int, sys.stdin.buffer.readline().split())\n\na, b = rm()\nc, d = rm()\nprint((c-a) * (d-b))\n\n\n\n\n\n\n\n\n\n\n\n\n\n'] | ['Runtime Error', 'Accepted'] | ['s527314658', 's392625273'] | [26928.0, 9212.0] | [116.0, 25.0] | [269, 129] |
p03101 | u839857256 | 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\n\ninput = sys.stdin.readline\nH, W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H*W-H*h-W*w+h*w)\n', 'import sys\n\ninput = sys.stdin.readline\nH, W = map(int, input().split())\nh, w = map(int, input().split())\nprint(H*W-H*w-W*h+h*w)\n'] | ['Wrong Answer', 'Accepted'] | ['s406652359', 's593167830'] | [2940.0, 2940.0] | [18.0, 17.0] | [128, 128] |
p03101 | u842054747 | 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 white_marker():\n line, row = map(int,input().split())\n line_marker, row_marker = map(int, input().split())\n line -= line_marker\n row -= row_marker\n \n return line * row', 'line, row = map(int,input().split())\nline_marker, row_marker = map(int, input().split())\nline -= line_marker\nrow -= row_marker\nprint(line * row)'] | ['Wrong Answer', 'Accepted'] | ['s456150236', 's106723442'] | [2940.0, 2940.0] | [17.0, 18.0] | [177, 144] |
p03101 | u848654125 | 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. | ['total_cost = 0\n\nN, M = (map(int, input().split()))\n\nAB_list = []\nfor i in range(N):\n AB_list.append((list(map(int, input().split()))))\n\nAB_list = sorted(AB_list)\n\nfor i in range(N):\n if AB_list[i][1]<M:\n M = M - AB_list[i][1]\n total_cost = total_cost + AB_list[i][0] * AB_list[i][1]\n else:\n total_cost = total_cost + M * AB_list[i][0]\n break\nprint(total_cost)\n', '\ntotal_cost = 0\n\nN, M = (map(int, input().split()))\n\nAB_list = []\nfor i in range(N):\n AB_list.append((list(map(int, input().split()))))\n\nAB_list.sort()\n\nfor i in range(N):\n if AB_list[i][1]<M:\n M = M - AB_list[i][1]\n total_cost = total_cost + AB_list[i][0] * AB_list[i][1]\n else:\n total_cost = total_cost + M * AB_list[i][0]\n break\nprint(total_cost)\n', 'import scipy as sp\n\nanswer = 0\nA, B = map(int, input().split()) \nfor i in sp.arange(A, B+1):\n answer = answer ^ i\nprint(answer)', '\nH, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((H-h)*(W-w))'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s050187586', 's389218836', 's503605495', 's019048762'] | [3064.0, 3064.0, 12504.0, 2940.0] | [20.0, 17.0, 158.0, 17.0] | [398, 388, 130, 86] |
p03101 | u849647454 | 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())\nTOTAL = H * W\ntotal = h * w\nresult = TOTAL - total\nprint(resurt)', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nTOTAL = H * W\ntotal = h * w\nresult = TOTAL - total\nprint(result)', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nTOTAL = H * W\ntotal = (W * h + H * w)-h*w\nresult = TOTAL - total\nprint(result)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s020515143', 's292606444', 's587707999'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [126, 126, 140] |
p03101 | u849756457 | 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(i) for i in input().split()]\n_, _ = input()\n\nprint(h * w - (h + w - 1))', 'h, w = [int(i) for i in input().split()]\n_ = input()\n \nprint(h * w - (h + w - 1))', 'h, w = [int(i) for i in input().split()]\nh1, w1 = [int(i) for i in input().split()]\n \nprint(h * w - (h * w1 + w * h1 - h1 * w1))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s396570992', 's667664869', 's854859690'] | [9096.0, 9072.0, 9168.0] | [28.0, 26.0, 25.0] | [83, 81, 128] |
p03101 | u850390157 | 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\ndef even_odd(x, n):\n if n == 1:\n if x % 4 == 1 or x % 4 == 2:\n return 1\n else:\n return 0\n\n num = (x % (2 ** n)) - 2 ** (n - 1)\n if num < 0:\n return 0\n elif num % 2 == 0:\n return 1\n else:\n return 0\n\ns = 0\nfor i in range(1, 40):\n if (even_odd(B, i) + even_odd(A-1, i)) % 2 == 1:\n s += 2 ** (i - 1)\nprint(s)', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((H - h) * (W - w))'] | ['Wrong Answer', 'Accepted'] | ['s002494450', 's322191272'] | [3064.0, 2940.0] | [17.0, 17.0] | [420, 91] |
p03101 | u856234158 | 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. | ['tmp = input()\nH = int(tmp.split()[0])\nW = int(tmp.split()[1])\n\ntmp = input()\nh = int(tmp.split()[0])\nw = int(tmp.split()[1])\n\nans = W*h+H*w - h*w\nprint(ans)', 'tmp = input()\nH = int(tmp.split()[0])\nW = int(tmp.split()[1]) \ntmp = input()\nh = int(tmp.split()[0])\nw = int(tmp.split()[1])\nans = H*W-W*h-H*w+h*w\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s703365645', 's056832692'] | [3064.0, 3060.0] | [18.0, 18.0] | [156, 159] |
p03101 | u857408368 | 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 = int(H * W)\n\nwhite -= h * w\n\nprint(white)\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nwhite = int(H * W)\nblack = int(H*h + W*w)\nwhite = white - black + h*w\n\nprint(white)\n', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nwhite = int(H * W)\nblack = int(H*w + W*h)\nwhite = white - black + h*w\n\nprint(white)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s035170688', 's741125555', 's910155999'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [116, 151, 151] |
p03101 | u864069774 | 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 \nxor = A\nfor i in range(B-A):\n xor = xor ^ (A + i+1)\n \nprint(xor)', 'H, W = map(int,input().split())\nh, w = map(int,input().split())\n\nans = (H-h)*(W-w)\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s550506917', 's512348724'] | [2940.0, 2940.0] | [17.0, 17.0] | [101, 96] |
p03101 | u864453204 | 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. | ["\nl = lsit(map(int, input().split(' ')))\ns = lsit(map(int, input().split(' ')))\n\nprint(int((l[1]-s[1])*(l[0]-s[0])))", "\nl = list(map(int, input().split(' ')))\ns = list(map(int, input().split(' ')))\n\nprint(int((l[1]-s[1])*(l[0]-s[0])))"] | ['Runtime Error', 'Accepted'] | ['s504219620', 's183226577'] | [2940.0, 2940.0] | [17.0, 17.0] | [115, 115] |
p03101 | u865067466 | 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 main():\n H, W = map(int, input())\n h, w = map(int, input())\n\n print(H*W - h*w)\n\n\nif __name__ == "__main__":\n main()\n', 'def main():\n H, W = map(int, input().split())\n h, w = map(int, input().split())\n\n print(H*W - (h*W + (H-h)*w))\n\n\nif __name__ == "__main__":\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s980289199', 's215683329'] | [2940.0, 2940.0] | [17.0, 17.0] | [132, 160] |
p03101 | u867848444 | 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=[int(input()) for i in range(4)]\n\nans=s[1]*s[2]-s[2]*s[3]-s[1]*s[4]+s[3]*s[4]\nprint(ans)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\n\nprint((H-h)*(W-w))\n'] | ['Runtime Error', 'Accepted'] | ['s338930101', 's458947371'] | [2940.0, 2940.0] | [17.0, 18.0] | [90, 78] |
p03101 | u870178975 | 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))'] | ['Wrong Answer', 'Accepted'] | ['s034038674', 's020711079'] | [2940.0, 2940.0] | [18.0, 17.0] | [83, 83] |
p03101 | u871596687 | 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 = map(int,input().split())\nh,w = map(int,input().split())\n\nprint(H*W-h*W-H*w+h*w)'] | ['Wrong Answer', 'Accepted'] | ['s232126792', 's725881438'] | [2940.0, 2940.0] | [18.0, 17.0] | [77, 85] |
p03101 | u874333466 | 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. | ['matrix = list(map(int,input().split()))\nshitei = list(map(int,input().split()))\n\nmasume = matrix[0]*matrix[1]\nblack = shitei[0]*matrix[1]+shitei[0]*(matrix[0]-shitei[0])\nwhite = masume-black\n\nprint(white)', 'matrix = list(map(int,input().split()))\nshitei = list(map(int,input().split()))\n\nmasume = matrix[0]*matrix[1]\nblack = shitei[0]*matrix[1]+shitei[1]*(matrix[0]-shitei[0])\nwhite = masume-black\n\nprint(white)'] | ['Wrong Answer', 'Accepted'] | ['s803299700', 's437541374'] | [3060.0, 3060.0] | [17.0, 17.0] | [204, 204] |
p03101 | u875028418 | 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=[int(x)for x in input().split()]\nc,d=[int(x)for x in input().split()]\nprint(a*b-c*d)', 'a,b=[int(x)for x in input().split()]\nc,d=[int(x)for x in input().split()]\nprint((a-c)*(b-d))'] | ['Wrong Answer', 'Accepted'] | ['s483180098', 's338989388'] | [2940.0, 2940.0] | [17.0, 18.0] | [88, 92] |
p03101 | u879870653 | 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())\na,b = map(int,input().split())\n\nprint((H-h)*(W-w))\n', 'A,B = map(int,input().split())\na,b = map(int,input().split())\nprint((A-a)*(B-b))\n'] | ['Runtime Error', 'Accepted'] | ['s521178727', 's086339250'] | [2940.0, 2940.0] | [17.0, 18.0] | [82, 81] |
p03101 | u883574098 | 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 io, sys, atexit, os\n\nimport math as ma\nfrom sys import exit\nfrom decimal import Decimal as dec\nfrom itertools import permutations\n\n\ndef li ():\n\treturn list (map (int, input ().split ()))\n\n\ndef num ():\n\treturn map (int, input ().split ())\n\n\ndef nu ():\n\treturn int (input ())\n\n\ndef find_gcd ( x, y ):\n\twhile (y):\n\t\tx, y = y, x % y\n\treturn x\n\n\nmm = 1000000007\n\n\n\ndef solve ():\n\tt = 1\n\tfor it in range (t):\n\t\ta,b=num()\n\t\tc,d=num()\n\t\tprint(a*b-c*d)\n\n\n\n\n\nif __name__ == "__main__":\n\tsolve ()', 'import io, sys, atexit, os\n\nimport math as ma\nfrom sys import exit\nfrom decimal import Decimal as dec\nfrom itertools import permutations\n\n\ndef li ():\n\treturn list (map (int, input ().split ()))\n\n\ndef num ():\n\treturn map (int, input ().split ())\n\n\ndef nu ():\n\treturn int (input ())\n\n\ndef find_gcd ( x, y ):\n\twhile (y):\n\t\tx, y = y, x % y\n\treturn x\n\n\nmm = 1000000007\n\n\n\ndef solve ():\n\tt = 1\n\tfor it in range (t):\n\t\ta,b=num()\n\t\tc,d=num()\n\t\tff=c*b+a*d-(c*d)\n\t\tprint(a*b-ff)\n\n\n\n\n\nif __name__ == "__main__":\n\tsolve ()'] | ['Wrong Answer', 'Accepted'] | ['s361102844', 's605880519'] | [5972.0, 5588.0] | [276.0, 234.0] | [492, 510] |
p03101 | u886902015 | 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-h)*(W-w))\n'] | ['Wrong Answer', 'Accepted'] | ['s493414334', 's522593901'] | [9112.0, 9092.0] | [26.0, 28.0] | [80, 77] |
p03101 | u891482208 | 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))'] | ['Wrong Answer', 'Accepted'] | ['s699066032', 's369270127'] | [3316.0, 2940.0] | [21.0, 17.0] | [94, 104] |
p03101 | u896741788 | 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,s=map(int,input().split())\nf,g=map(int,input().split())\nprint(a*s-f*g)', 'a,s=map(int,input().split())\nf,g=map(int,input().split())\nprint((a-f)*(s-g))'] | ['Wrong Answer', 'Accepted'] | ['s717083599', 's987774754'] | [2940.0, 2940.0] | [17.0, 17.0] | [72, 76] |
p03101 | u897328029 | 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()))\n\nans = (H - h) * (W - w)\nprint(ansj\n ', 'H, W = list(map(int, input().split()))\nh, w = list(map(int, input().split()))\n\nans = (H - h) * (W - w)\nprint(ans)\n '] | ['Runtime Error', 'Accepted'] | ['s357806034', 's709805027'] | [2940.0, 2940.0] | [17.0, 17.0] | [120, 120] |
p03101 | u899929023 | 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 Math\n\nlst=input().split(" ")\nH=int(lst[0])\nW=int(lst[1])\nlst=input().split(" ")\nh=int(lst[0])\nw=int(lst[1])\n\nprint(H*W-(h*W+H*w-h*w)) ', 'lst=input().split(" ")\nH=int(lst[0])\nW=int(lst[1])\nlst=input().split(" ")\nh=int(lst[0])\nw=int(lst[1])\n\nprint(H*W-(h*W+H*w-h*w)) '] | ['Runtime Error', 'Accepted'] | ['s910418799', 's584682977'] | [3060.0, 3060.0] | [17.0, 17.0] | [141, 128] |
p03101 | u900688325 | 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))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\nprint((H-h)*(W-w))'] | ['Runtime Error', 'Accepted'] | ['s527399981', 's787187974'] | [2940.0, 2940.0] | [18.0, 17.0] | [81, 84] |
p03101 | u901397311 | 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*b - (b*c + (a-c)*d))'] | ['Wrong Answer', 'Accepted'] | ['s632564400', 's357388334'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 90] |
p03101 | u904943473 | 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\nsum = H * w\ncnt = W * h + w * (H - h)\nprint(sum - cnt)', 'H,W = map(int, input().split())\nh,w = map(int, input().split())\n\nsum = H * w\ncnt = W * h + w * (H - h)\nprint(sum - cnt)', 'H,W = map(int, input().split())\nh,w = map(int, input().split())\n\nsum = H * W\ncnt = (W * h) + (w * (H - h))\nprint(sum - cnt)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s154954365', 's760360150', 's192333357'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [103, 119, 123] |
p03101 | u906327218 | 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. | ['math_line = list(map(int,input().split()))\ninput_line = list(map(int,input().split()))\n\narea = math_line[0]*math_line[1]\u3000\n\nblack_cell = math_line[0]*input_line[1] + math_line[1]*input_line[0] \nduplicate = black_cell - input_line[0]*input_line[1]\n\nwhite_cell = area - duplicate\n\nprint(white_cell)', 'math_line = list(map(int,input().split()))\ninput_line = list(map(int,input().split()))\n\narea = math_line[0]*math_line[1]\nblack_cell = math_line[0]*input_line[1] + math_line[1]*input_line[0]\nduplicate = black_cell - input_line[0]*input_line[1]\nwhite_cell = area - duplicate\n\nprint(white_cell)'] | ['Runtime Error', 'Accepted'] | ['s272498113', 's593748494'] | [2940.0, 3064.0] | [17.0, 17.0] | [298, 292] |
p03101 | u907484038 | 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-h-w)', 'H,W = list(map(int, input().split()))\nh,w = list(map(int, input().split()))\nprint(W*H-(W-w)*(H-h)', 'H,W = list(map(int, input().split()))\nh,w = list(map(int, input().split()))\nprint(W*H-(W-w)*(H-h))', 'H,W = list(map(int, input().split()))\nh,w = list(map(int, input().split()))\nprint((W-w)*(H-h))'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s403220348', 's407578981', 's467560737', 's231633629'] | [3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [94, 97, 98, 94] |
p03101 | u911153222 | 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())\na, b = map(int, input())\n\nprint(h*w - (h*b + w*a - a*b))\n', 'h, w = map(int, input().split())\na, b = map(int, input().split())\n\nprint(h*w - (h*b + w*a - a*b))\n'] | ['Runtime Error', 'Accepted'] | ['s147914252', 's043252505'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 98] |
p03101 | u917140501 | 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+H*w-h*w))'] | ['Wrong Answer', 'Accepted'] | ['s820306254', 's976828374'] | [2940.0, 2940.0] | [18.0, 17.0] | [78, 88] |
p03101 | u920103253 | 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\nans = H*w + h*W - h*w\n\nprint(ans)', 'H,W = [int(x) for x in input().split()]\nh,w = [int(x) for x in input().split()]\n \nans = (H-h)*(W-w)\n \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s013290005', 's071637280'] | [2940.0, 2940.0] | [17.0, 17.0] | [114, 112] |
p03101 | u921632705 | 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 = int(input())\nprint(2*x*3.14)', 'x = map(int, input().split())\nprint(2*x*3.14)', 'x,y = map(int, input().split())\na,b = map(int, input().split())\nprint((x-a)*(y-b))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s579776338', 's695707188', 's617092500'] | [9144.0, 9072.0, 9144.0] | [24.0, 27.0, 30.0] | [32, 45, 82] |
p03101 | u921773161 | 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*c-b*d)', 'a,b = map(int,input().split())\nc,d = map(int,input().split())\nprint(a*b+c*d-a*d-b*c)'] | ['Wrong Answer', 'Accepted'] | ['s039910293', 's915833599'] | [2940.0, 3064.0] | [18.0, 18.0] | [84, 84] |
p03101 | u923341003 | 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 \nH = HW[0]\nW = HW[1]\n \nh = hw[0]\nw = hw[1]\n \nif H >= W:\n print(H * W - (H * h + (W - h) * w))\nelse:\n print(H * W - (W * h + (H - h) * w))', 'HW = list(map(int, input().split()))\nhw = list(map(int, input().split()))\n \nH = HW[0]\nW = HW[1]\n \nh = hw[0]\nw = hw[1]\n \nprint(H * W - (H * h + (W - h) * w))', 'HW = list(map(int, input().split()))\nhw = list(map(int, input().split()))\n \nH = HW[0]\nW = HW[1]\n \nh = hw[0]\nw = hw[1]\n\nif H <= W:\n print(H * W - (H * h + (W - h) * w))\nelse:\n print(H * W - (W * w + (H - w) * h))', 'HW = list(map(int, input().split()))\nhw = list(map(int, input().split()))\n\nH = HW[0]\nW = HW[1]\n\nh = hw[0]\nw = hw[1]\n\nreturn H * W - (H * h + (W - h) * w)\n', 'N = int(input())\na = [input() for i in range(N)]\nprint(a)', 'HW = list(map(int, input().split()))\nhw = list(map(int, input().split()))\nH = HW[0]\nW = HW[1]\nh = hw[0]\nw = hw[1]\nr = H * W - (W * h + (H - h) * w)\nprint(r)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s237353779', 's533661541', 's611420553', 's644356176', 's674046755', 's069221750'] | [3064.0, 3060.0, 3064.0, 2940.0, 2940.0, 3060.0] | [17.0, 18.0, 19.0, 17.0, 17.0, 18.0] | [214, 156, 213, 154, 57, 156] |
p03101 | u924671994 | 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 k in range(n)]\n \ncount=0\n \nfor i in range(n):\n absum=0\n for j in range(m):\n absum +=a[i][j]*b[j]\n \n ans=absum+c\n if ans>0:\n count+=1\n \nprint(count)', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\na=[list(map(int,input().split())) for k in range(n)]\n \ncount=0\n \nfor i in range(n):\n absum=0\n for j in range(m):\n absum+=a[i][j]*b[j]\n \n ans=absum+c\n if ans>0:\n count+=1\n \nprint(count)', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\n\ns=(H-h)*(W-w)\n\nprint(s)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s131743705', 's943737667', 's166717781'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [266, 272, 82] |
p03101 | u924715151 | 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))', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\n\nprint((H-h)*(W-w))'] | ['Runtime Error', 'Accepted'] | ['s963838806', 's825899640'] | [2940.0, 2940.0] | [18.0, 17.0] | [77, 81] |
p03101 | u928784113 | 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-1)', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\n\nprint((H-h)*(W-w))'] | ['Wrong Answer', 'Accepted'] | ['s692504526', 's301741721'] | [2940.0, 2940.0] | [17.0, 17.0] | [75, 81] |
p03101 | u932913455 | 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\nimport sys\n\nH, W = input().split()\nh, w = input().split()\n\nH = int(H)\nW = int(W)\nh = int(h)\nw = int(w)\n\nprint(H, W, h, w)\n\nremain = H * W \nremain -= h * W\nremain -= w * (H - h)\n\nprint(remain)', 'import numpy as np\nimport sys\n\nH, W = input().split()\nh, w = input().split()\n\nH = int(H)\nW = int(W)\nh = int(h)\nw = int(w)\n\nremain = H * W \nremain -= h * W\nremain -= w * (H - h)\n\nprint(remain)'] | ['Wrong Answer', 'Accepted'] | ['s535477072', 's684344438'] | [12420.0, 12720.0] | [157.0, 251.0] | [235, 216] |
p03101 | u933129390 | 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\n\nH, W = map(int, input().split())\nh, w = map(int, input().split())\ntable = np.array([[0 for i in range(W)] for j in range(H)])\nans = 0\nfor i in range(h):\n table[i] += 1\nfor i in range(H):\n table[i][:w] += 1\n ans += sum(table[i])\nprint(table)\nprint((H*W)-(ans-(h*w)))\n', 'import numpy as np\n\n\nH, W = map(int, input().split())\nh, w = map(int, input().split())\ntable = np.array([[0 for i in range(W)] for j in range(H)])\nans = 0\nfor i in range(h):\n table[i] += 1\nfor i in range(H):\n table[i][:w] += 1\n ans += sum(table[i])\nprint((H*W)-(ans-(h*w)))\n'] | ['Wrong Answer', 'Accepted'] | ['s221405217', 's945930919'] | [12452.0, 12452.0] | [155.0, 148.0] | [296, 283] |
p03101 | u940279019 | 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(int((H*W)-(h*H+w*W - h*w)))', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint(int((H*W)-(h*W+w*H - h*w)))'] | ['Wrong Answer', 'Accepted'] | ['s261818987', 's188963771'] | [2940.0, 2940.0] | [17.0, 17.0] | [95, 95] |
p03101 | u941439555 | 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()))\nh, w = list(map(int, input()))\n\ntotal = H * W\nblack = h * W + H * w - h * w\nwhite = total - black\nprint(white)', 'N, M = list(map(int, input().split()))\n\n# Insert all the data into dictionary\nstores = []\nwhile 1:\n\ttry:\n\t\ta, b = list(map(int, input().split()))\n\t\tstores.append([a,b])\n\texcept:\n\t\tbreak\n\nstores = sorted(stores, key=lambda x:x[0])\n\nm = 0\nmoney = 0\n\nfor store in stores:\n\tmoney += min(store[1], M - m) * store[0]\n\tif m == M:\n\t\tbreak\nprint(money)\n \nprint(stores)', 'H, W = list(map(int, input().split()))\nh, w = list(map(int, input().split()))\n\ntotal = H * W\nblack = h * W + H * w - h * w\nwhite = total - black\nprint(white)\n\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s274150333', 's293772662', 's996608475'] | [2940.0, 3064.0, 2940.0] | [18.0, 17.0, 17.0] | [141, 366, 159] |
p03101 | u947883560 | 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\nN, M, C = [int(x) for x in input().split()]\nB = np.array([int(x) for x in input().split()])\nA = np.array([[int(x) for x in input().split()] for _ in range(N)])\n \nprint(np.sum(A.dot(B) > -C))', 'H, W = [int(x) for x in input().split()]\nh, w = [int(x) for x in input().split()]\nprint((H-h)*(W-w))\n'] | ['Runtime Error', 'Accepted'] | ['s151335031', 's047411445'] | [12448.0, 2940.0] | [154.0, 17.0] | [209, 101] |
p03101 | u948911484 | 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'] | ['s525213256', 's902819525'] | [2940.0, 3316.0] | [17.0, 21.0] | [80, 85] |
p03101 | u950708010 | 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\u3000= (int(i) for i in input().split())\nh,w\u3000= (int(i) for i in input().split())\n\nprint ((H-h)*(W-w))', 'H,W=(int(i) for i in input().split())\nh,w=(int(i) for i in input().split())\n \nprint ((H-h)*(W-w))'] | ['Runtime Error', 'Accepted'] | ['s013904025', 's155680681'] | [2940.0, 2940.0] | [17.0, 19.0] | [104, 97] |
p03101 | u952894166 | 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-h) * (W-w))', 'H, W = list(map(int, input().split()))\nh, w = list(map(int, input().split()))\nprint((H-h) * (W-w))'] | ['Runtime Error', 'Accepted'] | ['s244356227', 's179913653'] | [2940.0, 2940.0] | [17.0, 17.0] | [99, 98] |
p03101 | u955125992 | 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"""\nCreated on Tue Mar 19 17:00:19 2019\n\n@author: Koki Yagihara\n"""\n\nH, W = map(int, input().split())\nh, w = map(int, input().split())\ns = 1\nwhite = H*W\nblack = h + w - s\nR = white - black\nprint("{}".format(R))', 'H, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint(H*W - (H*w + W*h - h*w))'] | ['Wrong Answer', 'Accepted'] | ['s275462207', 's155739472'] | [3060.0, 2940.0] | [17.0, 18.0] | [234, 97] |
p03101 | u957722693 | 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(int(H*W-h*w))', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(int(H*W-h*W-H*w+h*w))\n'] | ['Wrong Answer', 'Accepted'] | ['s076463015', 's801127435'] | [3316.0, 3316.0] | [18.0, 19.0] | [77, 86] |
p03101 | u957872856 | 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'] | ['s424529893', 's912597599'] | [2940.0, 2940.0] | [18.0, 17.0] | [80, 84] |
p03101 | u957957759 | 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())\nprin(int((H-h)*(W-w)))', 'H,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(int((H-h)*(W-w)))'] | ['Runtime Error', 'Accepted'] | ['s967963285', 's531695787'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 81] |
p03101 | u960171798 | 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(" "))\nprint{(x-X)*(y-Y)}', 'x, y = map(int, input().split(" "))\nX, Y = map(int, input().split(" "))\nptint{(x-X)*(y-Y)}', 'x, y = map(int, input().split(" "))\nX, y = map(int, input().split(" "))\nprint{(x-X)*(y-Y)}', 'x, y = map(int, input().split(" "))\nX, y = map(int, input().split(" "))\nptint{(x-X)*(y-Y)}', '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 condition = C\n for j in range(M):\n condition += A[j]*B[j]\n if condition > 0:\n ans += 1\nprint(ans)', 'x, y = map(int, input().split(" "))\nX, y = map(int, input().split(" "))\nprint{(x-X)*(y-Y)}', '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', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s030764319', 's048932245', 's220111297', 's275390596', 's587245745', 's831755007', 's847435932', 's707095452'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [92, 92, 90, 92, 242, 92, 89, 89] |
p03101 | u969190727 | 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(input()).split()\nh,w=int(input()).split()\nprint((H-h)*(W-w))', 'N,M,C=map(int,(input()).split())\nList_B=[int(i) for i in (input()).split()]\nt=0\nfor j in range(1,N+1):\n List_A=[int(k) for k in (input()).split()]\n if sum([x*y for (x,y) in zip(List_A,List_B)])>-C:\n t+=1\nprint(t)\n', 'H,W=map(int,(input()).split())\nh,w=map(int,(input()).split())\nprint((H-h)*(W-w))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s580085541', 's912753476', 's074863637'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [68, 218, 80] |
p03101 | u972658925 | 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())\nplint((H-h)*(W-w))', 'H,W = map(int,input().split())\nh,w = map(int,input().split())\nprint((H-h)*(W-w))'] | ['Runtime Error', 'Accepted'] | ['s488383532', 's999166079'] | [3064.0, 2940.0] | [17.0, 17.0] | [80, 80] |
p03101 | u975884051 | 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 * w) - (W * h) + (h * w))\n'] | ['Wrong Answer', 'Accepted'] | ['s676233066', 's417716163'] | [2940.0, 2940.0] | [17.0, 18.0] | [111, 112] |
p03101 | u977642052 | 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\nhttps://atcoder.jp/contests/abc121/tasks/abc121_a\n\n>>> main([3, 2], [2, 1])\n1\n>>> main([5, 5], [2, 3])\n6\n>>> main([2, 4], [2, 4])\n0\'\'\'\n\n\ndef main(amount, portion):\n print((amount[0] - portion[0]) * (amount[1] - portion[1]))\n\n\nif __name__ == "__main__":\n amount = map(int, input().split(\' \'))\n portion = map(int, input().split(\' \'))\n\n main(amount, portion)\n', '\'\'\'A - White Cells\nhttps://atcoder.jp/contests/abc121/tasks/abc121_a\n\n>>> main([3, 2], [2, 1])\n1\n>>> main([5, 5], [2, 3])\n6\n>>> main([2, 4], [2, 4])\n0\'\'\'\n\n\ndef main(amount, portion):\n print((amount[0] - portion[0]) * (amount[1] - portion[1]))\n\n\nif __name__ == "__main__":\n amount = list(map(int, input().split(\' \')))\n portion = list(map(int, input().split(\' \')))\n\n main(amount, portion)\n'] | ['Runtime Error', 'Accepted'] | ['s794256981', 's318177830'] | [3060.0, 3060.0] | [18.0, 17.0] | [387, 399] |
p03101 | u983599131 | 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. | ['in1 = input().split()\nin2 = input().split()\n\nH = in1[0]\nW = in1[1]\n\nh = in2[0]\nw = in2[1]\n\nprint((H - h) * (W - w))\n', 'in1 = input().split()\nin2 = input().split()\n\nH = int(in1[0])\nW = int(in1[1])\n\nh = int(in2[0])\nw = int(in2[1])\n\nprint((H - h) * (W - w))\n\n'] | ['Runtime Error', 'Accepted'] | ['s646870351', 's681333605'] | [2940.0, 2940.0] | [17.0, 17.0] | [116, 137] |
p03101 | u987164499 | 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 sys import stdin\n\nH,W = [int(x) for x in stdin.readline().rstrip().split()]\nh,w = [int(x) for x in stdin.readline().rstrip().split()]\n\nprint(H*W-h*W+H*w-h*w)', 'from sys import stdin\n\nH,W = [int(x) for x in stdin.readline().rstrip().split()]\nh,w = [int(x) for x in stdin.readline().rstrip().split()]\n\nprint(H*W-h*W-H*w+h*w)'] | ['Wrong Answer', 'Accepted'] | ['s514249694', 's957645337'] | [2940.0, 2940.0] | [17.0, 17.0] | [162, 162] |
p03101 | u990671997 | 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. | ['W, H = map(int, input().split())\nw, h = map(int, input().split())\n\nprint(W*H - w*h)', 'W, H = map(int, input().split())\nw, h = map(int, input().split())\n\nprint(W*H - w*H - h*W + w*h)'] | ['Wrong Answer', 'Accepted'] | ['s166380448', 's973107891'] | [2940.0, 2940.0] | [17.0, 17.0] | [85, 97] |
p03101 | u992910889 | 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())\nA = []\n \nfor i in range(N):\n A.append(list(map(int, input().split())\n \ndef main():\ncnt = 0\nfor i in range(N):\n val = C\n for j in range(M):\n val += A[i][j] * B[j]\n if val > 0:\n cnt += 1\nreturn cnt\nprint(main)', 'N, M, C = list(map(int, input().split()))\nB = list(map(int, input().split())\nA = []\n\nfor i in range(N):\nA.append(list(map(int, input().split())\n\ndef main():\ncnt = 0\nfor i in range(N):\nval = C\nfor j in range(M):\n val += A[i][j] * B[j]\nif val > 0:\ncnt += 1\nreturn cnt\nprint(main)\n ', '# Your code here!\nH,W=map(int,input().split())\nh,w=map(int,input().split())\nprint(H*h-W*w)', '# coding: utf-8\n# Your code here!\nH,W=map(int,input().split())\nh,w=map(int,input().split())\nprint((H-h)*(W-w))'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s079650616', 's485887720', 's844797759', 's580961822'] | [2940.0, 2940.0, 2940.0, 2940.0] | [19.0, 17.0, 17.0, 19.0] | [287, 292, 90, 110] |
p03101 | u995102075 | 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(input().split())\nh, w = int(input().split())\n\nprint((H - h) * (W - w))\nH, W = map(int, input().split())\nh, w = map(int, input().split())\n\nprint((H - h) * (W - w))\n', 'H, W = int(input().split())\nh, w = int(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', 'Runtime Error', 'Accepted'] | ['s085592284', 's213749716', 's308782218'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [174, 82, 92] |
p03102 | u007550226 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['N,M,C = map(int,input().split())\nb = list(map(int, input().split()))\na = []\nfor _ in range(N):\n l = list(map(int, input().split()))\n a.append(l)\n\nprint(b)\nprint(a)\n\nc = 0\nfor i in range(N):\n g = 0\n for aa,bb in zip(a[i],b):\n g += aa*bb\n g += c\n if g > 0:\n c += 1\nprint(c//2)', "N,M,C = map(int,input().split())\nb = list(map(int, input().split()))\na = []\nfor _ in range(N):\n l = list(map(int, input().split()))\n a.append(l)\n\n#print(b)\n#print(a)\n\nc = 0\nfor i in range(N):\n g = 0\n for aa,bb in zip(a[i],b):\n g += aa*bb\n g += C\n #print('g:',g)\n if g > 0:\n c += 1\nprint(c)"] | ['Wrong Answer', 'Accepted'] | ['s500877193', 's133984898'] | [3064.0, 3060.0] | [18.0, 19.0] | [306, 324] |
p03102 | u024807881 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['from sys import stdin\n\n\ndef na():\n return map(int, stdin().split())\n\n\nn, _, c = na()\nbs = na()\n\ncnt = 0\nfor _ in range(n):\n if sum(x * y for x, y in zip(na(), bs)) > -c:\n cnt += 1\n\nprint(cnt)\n', 'from sys import stdin\n\n\ndef na():\n return map(int, stdin.readline().split())\n\n\nn, _, c = na()\nbs = na()\n\ncnt = 0\nfor _ in range(n):\n if sum(x * y for x, y in zip(na(), bs)) > -c:\n cnt += 1\n\nprint(cnt)\n', 'from sys import stdin\n\n\ndef na():\n return map(int, stdin.readline().split())\n\n\nn, _, c = na()\nbs = tuple(na())\n\ncnt = 0\nfor _ in range(n):\n if sum(x * y for x, y in zip(na(), bs)) > -c:\n cnt += 1\n\nprint(cnt)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s048620808', 's517730883', 's263318608'] | [2940.0, 3316.0, 2940.0] | [17.0, 22.0, 17.0] | [205, 214, 221] |
p03102 | u027675217 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\nl=[]\nans=[]\ncnt=0\nfor i in range(n):\n\ta=list(map(int,input().split()))\n\tl.append(a)\nfor i in range(n):\n\tsum=0\n\tfor j in range(m):\n\t\tsum+=b[j]*l[i][j]\n\t\tif j==(m-1):\n\t\t\tsum-=c\n\t\t\tans.append(sum)\nfor i in ans:\n\tif i>0:\n\t\tcnt+=1\nprint(cnt)', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\nl=[]\nans=[]\ncnt=0\nfor i in range(n):\n\ta=list(map(int,input().split()))\n\tl.append(a)\nfor i in range(n):\n\tsum=0\n\tfor j in range(m):\n\t\tsum+=b[j]*l[i][j]\n\t\tif j==(m-1):\n\t\t\tsum+=c\n\t\t\tans.append(sum)\nfor i in ans:\n\tif i>0:\n\t\tcnt+=1\nprint(cnt)\n'] | ['Wrong Answer', 'Accepted'] | ['s585042379', 's318550734'] | [3064.0, 3064.0] | [17.0, 17.0] | [300, 301] |
p03102 | u043146101 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['N,M,C = map(int,input().split())\nB = [int(x) for x in input().split()]\n\ncount = 0\nfor i in range(N):\n temp = [int(x) for x in input().split()]\n total = [B[i]*temp[i] for i in range(M)]\n if(total > 0 ):\n count+=1\n \n \n', 'N,M,C = map(int,input().split())\nB = [int(x) for x in input().split()]\n \ncount = 0\nfor i in range(N):\n temp = [int(x) for x in input().split()]\n total = [B[i]*temp[i] for i in range(M)]\n if((sum(total) - C) > 0 ):\n count+=1\nprint(count)\n ', 'N,M,C = map(int,input().split())\nB = [int(x) for x in input().split()]\n \ncount = 0\nfor i in range(N):\n temp = [int(x) for x in input().split()]\n total = [B[i]*temp[i] for i in range(M)]\n if(sum(total) > 0 ):\n count+=1\nprint(count)\n ', 'N,M,C = map(int,input().split())\nB = [int(x) for x in input().split()]\n \ncount = 0\nfor i in range(N):\n temp = [int(x) for x in input().split()]\n total = [B[i]*temp[i] for i in range(M)]\n if((sum(total) + C) > 0 ):\n count+=1\nprint(count)\n '] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s091422464', 's560405921', 's933150099', 's990256632'] | [3060.0, 3060.0, 3060.0, 3064.0] | [17.0, 18.0, 17.0, 18.0] | [224, 245, 239, 245] |
p03102 | u046187684 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['import numpy as np\n\n\ndef solve(string):\n n, m, c, *ba = map(int, string.split())\n """\n b = np.asarray(ba[:m])\n a = np.asarray(ba[m:])\n a.resize((n, m))\n return str(np.sum(np.dot(a, b.T) > -c))\n """\n b = ba[:m]\n ans = 0\n for i in range(n):\n tmp = c\n for j in range(m):\n tmp += b[j] * ba[(i + 1) * n + j]\n if tmp > c:\n ans += 1\n return str(ans)\n\n\nif __name__ == \'__main__\':\n n, m, o = map(int, input().split())\n print(solve(\'{} {} {}\\n\'.format(n, m, o) + \'\\n\'.join([input() for _ in range(n + 1)])))\n', 'import numpy as np\n\n\ndef solve(string):\n n, m, c, *ba = map(int, string.split())\n """\n b = np.asarray(ba[:m])\n a = np.asarray(ba[m:])\n a.resize((n, m))\n return str(np.sum(np.dot(a, b.T) > -c))\n """\n ans = 0\n for i in range(n):\n tmp = c\n for j in range(m):\n tmp += ba[j] * ba[(i + 1) * m + j]\n if tmp > 0:\n ans += 1\n return str(ans)\n\n\nif __name__ == \'__main__\':\n n, m, o = map(int, input().split())\n print(solve(\'{} {} {}\\n\'.format(n, m, o) + \'\\n\'.join([input() for _ in range(n + 1)])))\n'] | ['Runtime Error', 'Accepted'] | ['s375731747', 's179601547'] | [14436.0, 13488.0] | [149.0, 180.0] | [580, 566] |
p03102 | u046585946 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['n,m,c=map(int,input().split())\nb=[0 for i in range(m)]\na=[[0 for i in range(m)]for i in range(n)]\nk=[0 for i in range(m)]\nans=0\ncount=0\nb=list(map(int,input().split()))\na=[list(map(int,input().split()))for i in range(n)]\nprint(b)\nprint(a)\nfor i in range(n):\n for j in range(m):\n ans=ans+a[i][j]*b[j]\n if (ans+c)>0:\n count=count+1\nprint(count)', 'n,m,c=map(int,input().split())\nb=[0 for i in range(m)]\na=[[0 for i in range(m)]for i in range(n)]\nans=0\ncount=0\nfor i in range(m):\n b[i]=int(input())\nfor i in range(n):\n for j in range(m):\n a[n][j]=int(input())\nfor i in range(n):\n for j in range(m):\n ans=ans+a[n][j]*b[j]\n if (ans+c)>0:\n count=count+1\nprint(count)', 'n,m,c=map(int,input().split())\nb=[0 for i in range(m)]\na=[[0 for i in range(m)]for i in range(n)]\nk=[0 for i in range(m)]\ncount=0\nb=list(map(int,input().split()))\na=[list(map(int,input().split()))for i in range(n)]\nfor i in range(n):\n ans=0\n for j in range(m):\n ans=ans+(a[i][j]*b[j])\n if (ans+c)>0:\n count=count+1\nprint(count)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s937968308', 's945927025', 's090152739'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [350, 327, 336] |
p03102 | u056358163 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['import numpy as np\nN, M, C = map(int, input().split()) \nB = np.array(list(map(int, input().split())))\nA = np.array([list(map(int,list(input()))) for i in range(N)])\n\nans = 0\nfor i in range(M):\n if np.sum(A[:, i] * B) + C > 0:\n ans += 1\nprint(ans)', 'import numpy as np\nN, M, C = map(int, input().split()) \nB = np.array(list(map(int, input().split())))\nA = np.array([list(map(int,list(input()))) for i in range(N)])\n\nans = 0\nfor i in range(N):\n val = np.sum(A[i, :] * B) + C\n if val > 0:\n ans += 1\nprint(ans)\n', 'import numpy as np\nN, M, C = map(int, input().split()) \nB = np.array(list(map(int, input().split())))\nA = np.array([list(map(int,list(input().split()))) for i in range(N)])\n \nans = 0\nfor i in range(N):\n val = np.sum(A[i, :] * B) + C\n if val > 0:\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s243382149', 's400289704', 's336040725'] | [13208.0, 13672.0, 12480.0] | [178.0, 148.0, 150.0] | [250, 271, 279] |
p03102 | u057964173 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['def resolve():\n cnt=0\n n,m,c=map(int, input().split())\n b_list=list(map(int, input().split()))\n for i in range(n):\n a_list=list(map(int, input().split()))\n for x in range(m):\n siki=0\n siki+=a_list[i]*b_list[i]\n if siki>-c:\n cnt+=1\n print(cnt)\nresolve()', 'def resolve():\n cnt = 0\n n, m, c = map(int, input().split())\n b_list = list(map(int, input().split()))\n for i in range(n):\n a_list = list(map(int, input().split()))\n siki = 0\n for x in range(m):\n siki += (a_list[x] * b_list[x])\n if siki+c > 0:\n cnt += 1\n print(cnt)\nresolve()'] | ['Runtime Error', 'Accepted'] | ['s270345366', 's492038255'] | [3060.0, 3060.0] | [18.0, 17.0] | [329, 344] |
p03102 | u062706707 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['#B\ncount = 0\nn,m,c = map(int, input().split())\nb = list(map(int, input().split()))\nfor i in range(n):\n a = list(map(int, input().split()))\n ab=0\n for j in range(n):\n ab = a[j] * b[j]\n if -c<ab:\n count += 1\nprint(count)', '#B\ncount = 0\nn,m,c = map(int, input().split())\nb = list(map(int, input().split()))\nfor i in range(n):\n a = list(map(int, input().split()))\n ab=0\n for j in range(m):\n ab = a[j] * b[j]\n if -c<ab:\n count += 1\nprint(count)', '#B\ncount = 0\nn,m,c = map(int, input().split())\nb = list(map(int, input().split()))\nfor i in range(n):\n a = list(map(int, input().split()))\n ab=0\n for j in range(m):\n ab = a[j] * b[j]\n if -c<ab:\n count += 1\nprint(count)', '#B\ncount = 0\nn,m,c = map(int, input().split())\nb = list(map(int, input().split()))\nfor i in range(n):\n a = list(map(int, input().split()))\n ab=0\n for j in range(m):\n ab += a[j] * b[j]\n if -c<ab:\n count += 1\nprint(count)'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s105025392', 's170375465', 's241056291', 's710644373'] | [3060.0, 3060.0, 3064.0, 3060.0] | [17.0, 17.0, 19.0, 17.0] | [244, 244, 244, 245] |
p03102 | u064434060 | 2,000 | 1,048,576 | There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}. Additionally, you are given integers B_1, B_2, ..., B_M and C. The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0. Among the N codes, find the number of codes that correctly solve this problem. | ['#import sys\n#import numpy as np\n#import math\n#import itertools\n#from fractions import Fraction\n#import itertools\nfrom collections import deque\n#import heapq\n#from fractions import gcd\n#input=sys.stdin.readline\nn,m,c=map(int,input().split())\nb=list(map(int,input().split()))\nans=0c\nfor i in range(n):\n a=list(map(int,input().split()))\n res=[a[i]*b[i] for i in range(m)]\n if sum(res)+c>0:\n ans+=1\nprint(ans)', '#import sys\n#import numpy as np\n#import math\n#import itertools\n#from fractions import Fraction\n#import itertools\nfrom collections import deque\n#import heapq\n#from fractions import gcd\n#input=sys.stdin.readline\nn,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 res=[a[i]*b[i] for i in range(m)]\n if sum(res)+c>0:\n ans+=1\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s741257386', 's230954156'] | [2940.0, 3316.0] | [17.0, 21.0] | [422, 422] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.