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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03102 | u490489966 | 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\nn, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for _ in range(n)]\n# print(a, b)\ncount=0\nfor i in a:\n for j in range(len(i)):\n i[j] *= b[j]\n if sum(i) >= -c:\n count += 1\n\nprint(count)', '#B\nn, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for _ in range(n)]\n# print(a, b)\ncount=0\nfor i in a:\n for j in range(len(i)):\n i[j] *= b[j]\n if sum(i) > -c:\n count += 1\n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s269325329', 's772617261'] | [3060.0, 3060.0] | [18.0, 18.0] | [267, 266] |
p03102 | u494871759 | 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 = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\ndef solve(a,b,c):\n val = 0\n for ia,ib in zip(a,b):\n val += ia*ib\n val += c\n return val > 0\n\ncnt = 0\nfor i in range(n):\n a = list(map(int,input().split())\n if solve(a,b,c):\n cnt += 1\n\nprint(cnt) ', 'n,m,c = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\ndef solve(a,b,c):\n val = 0\n for ia,ib in zip(a,b):\n val += ia*ib\n val += c\n return val > 0\n\ncnt = 0\nfor i in range(n):\n a = list(map(int,input().split()))\n if solve(a,b,c):\n cnt += 1\n\nprint(cnt) \n'] | ['Runtime Error', 'Accepted'] | ['s024528528', 's379071669'] | [2940.0, 3060.0] | [17.0, 17.0] | [304, 306] |
p03102 | u498620941 | 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 = [i for i in map(int,input().split())]\na = []\nfor j in range(n):\n a.append( [i for i in map(int,input().split())] )\n\n\nans = [0]*(n)\ncount = 0\nprint(ans)\nfor i in range(n) :\n for j in range(m):\n ans[i] += a[i][j] * b[j]\n if ans[i] + c > 0 :\n count += 1 \nprint(count)', 'n,m,c = map(int,input().split())\nb = [i for i in map(int,input().split())]\na = []\nfor j in range(n):\n a.append( [i for i in map(int,input().split())] )\n\n\nans = [0]*(n)\ncount = 0\nfor i in range(n) :\n for j in range(m):\n ans[i] += a[i][j] * b[j]\n if ans[i] + c > 0 :\n count += 1 \nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s101608145', 's562792898'] | [3188.0, 3064.0] | [18.0, 17.0] | [324, 313] |
p03102 | u502200133 | 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 = [list(map(int, input().split())) for _ in range(n)]\nans = 0\nfor i in range(n):\n total = c\n for j in range(m):\n total += a[i][j] * b[j]\n if total > 0:\n ans += 1\nprint(ans)', 'n, m, c = map(int, input().split())\nB = list(map(int, input().split()))\nA = [list(map(int, input().split())) for _ in range(n)]\nans = 0\nfor i in range(n):\n total = c\n for j in range(m):\n total += A[i][j] * B[j]\n if total > 0:\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s542695644', 's435329083'] | [3064.0, 3064.0] | [18.0, 18.0] | [269, 269] |
p03102 | u503111914 | 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(input().split()))\nresult = 0\nfor i in range(N):\n C = 0\n A = list(map(input().split()))\n for j in range(M):\n C += B[j]*A[j]\n if sum(C) > 0:\n result += 1\n else:\n None\nprint(result)', 'N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\nresult = 0\nfor i in range(N):\n D = 0\n A = list(map(int,input().split()))\n for j in range(M):\n D += B[j]*A[j]\n if D+C> 0:\n result += 1\n else:\n None\nprint(result)\n'] | ['Runtime Error', 'Accepted'] | ['s088742997', 's618879406'] | [3060.0, 3060.0] | [18.0, 18.0] | [238, 243] |
p03102 | u506587641 | 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 = [list(map(int, input().split())) for _ in range(n)]\nx = -c\nlst = []\ntmp = 0\n\nfor i in range(n):\n\n for j in range(m):\n x += a[i][j]*b[j]\n lst.append(x)\n\nfor i in range(n):\n if lst[i] > 0:\n tmp += 1\n\nprint(tmp)', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for _ in range(n)]\nlst = []\ntmp = 0\n\nfor i in range(n):\n \n x = -c\n for j in range(m):\n x += a[i][j]*b[j]\n lst.append(x)\n\nfor i in range(n):\n if lst[i] > 0:\n tmp += 1\n\nprint(tmp)', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for _ in range(n)]\nlst = []\ntmp = 0\n\nfor i in range(n):\n \n x = c\n for j in range(m):\n x += a[i][j]*b[j]\n lst.append(x)\n\nfor i in range(n):\n if lst[i] > 0:\n tmp += 1\n\nprint(tmp)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s341723032', 's959300887', 's822584323'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0] | [307, 315, 314] |
p03102 | u512138205 | 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()))\n\ncount = 0\nfor i in range(0, n - 1):\n a = list(map(int, input().split()))\n s = 0\n for j in range(0, m - 1):\n s += a[j] * b[j]\n if s + c > 0:\n count += 1\nprint(count)\n', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\n\ncount = 0\nfor i in range(0, n):\n a = list(map(int, input().split()))\n s = 0\n for j in range(0, m):\n s += a[j] * b[j]\n if s + c > 0:\n count += 1\nprint(count)\n'] | ['Wrong Answer', 'Accepted'] | ['s168541209', 's488523038'] | [3060.0, 3064.0] | [17.0, 22.0] | [264, 256] |
p03102 | u518042385 | 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. | ['a,s,d=map(int,input().split())\nlist=list(map(int,input().split()))\nc=0\nfor i in range(a):\n l=list(map(int,input().split()))\n sum=d\n for k in range(s):\n sum+=list[k]*l[k]\n if sum>0:\n c+=1\nprint(c)\n ', 'a,s,d=map(int,input().split())\nlis=list(map(int,input().split()))\nc=0\nfor i in range(a):\n l=list(map(int,input().split())) \n sum=d\n for k in range(s):\n sum+=lis[k]*l[k]\n if sum>0:\n c+=1\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s956648068', 's793931322'] | [3060.0, 3060.0] | [17.0, 18.0] | [208, 207] |
p03102 | u519996359 | 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 = map(int, input().split())\nA = [[0 for i in range(M)] for j in range(N)]\n\nfor i in range(N):\n\tA[i] = map(int, input().split())', 'N,M,C = map(int, input().split())\nB = map(int, input().split())\nA = []\n\nfor i in range(N):\n\tA[i] = map(int, input().split())\n\nans = 0\n\nfor i in range(N):\n\ttmp = 0\n\tfor n in range(M):\n\t\ttmp += A[i][n]*B[n]\n\tif(tmp+C>0):\n\t\tans += 1\n\nprint(ans)\n', 'N,M,C = map(int, input().split())\nB = map(int, input().split())\nA = [[0 for i in range(M)] for j in range(N)]\n\nfor i in range(N):\n\tA[i] = map(int, input().split())\n\nans = 0\n\nfor i in range(N):\n\ttmp = 0\n\tfor j in range(M):\n\t\ttmp = tmp + A[i][j]*B[j]\n\tif(tmp+C>0):\n\t\tans += 1\n\nprint(ans)\n', 'N,M,C = map(int, input().split())\nB = map(int, input().split())\nA = [[0 for i in range(M)] for j in range(N)]\n\nfor i in range(N):\n\tA[i] = map(int, input().split())\n\nans = 0\n\nfor i in range(N):\n\ttmp = 0\n\tfor n in range(M):\n\t\ttmp += A[i][n]*B[n]\n\tif(tmp+C>0):\n\t\tans += 1\n\nprint(ans)\n', 'N,M,C = map(int, input().split())\nB = map(int, input().split())\nA = []\n\nfor i in range(20):\n\tA.append(map(int, input().split()))\n\nans = 0\n\nfor i in range(N):\n\ttmp = 0\n\tfor j in range(M):\n\t\ttmp = tmp + A[i][j]*B[j]\n\tif(tmp+C>0):\n\t\tans += 1\n\nprint(ans)\n', 'N,M,C = list(map(int, input().split()))\nB = list(map(int, input().split()))\nA = []\n\nfor i in range(N):\n\tA.append(list(map(int, input().split())))\n\nans = 0\n\nfor i in range(N):\n\ttmp = 0\n\tfor j in range(M):\n\t\ttmp = tmp + A[i][j]*B[j]\n\tif(tmp+C>0):\n\t\tans += 1\n\nprint(ans)\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s107265542', 's265221240', 's282611366', 's306349788', 's579339010', 's050695442'] | [3060.0, 3064.0, 3064.0, 3064.0, 3060.0, 3064.0] | [17.0, 18.0, 18.0, 17.0, 17.0, 17.0] | [163, 242, 286, 281, 251, 268] |
p03102 | u527261492 | 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 = [int(k) for k in input().split()]\nA = [[int(j) for j in input().split()] for i in range(1,N+1)] \nb = np.array(B)\ncnt = 0\nfor i in range(1,N+1):\n if (np.dot(np.array(A[i]),b) + C >0):\n cnt += 1\n else:\n cnt = cnt\n \nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = list(int,input().split())\nfor i in range(1,N)\n Ai = list(int,input().split())\n \n\nai = np.array(Ai)\nb = np.array(B)\n\nait = ai.reshape([N,1])\ncnt = 0\nfor i in range(1,N)\n if (np.dot(ait,b) + C >0)\n cnt += 1\nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = list(int,input().split())\nfor i in range(1,N)\n Ai = list(int,input().split())\n ai = np.array(Ai)\nb = np.array(B)\nbt = b.reshape([N,1])\ncnt = 0\nfor i in range(1,N)\n if (np.dot(ai,bt) + C >0)\n cnt += 1\nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int,input().split()]\nfor i in range(1,N)\n Ai = [int(j) for j in input().split()]\n ai = np.array(Ai) \nb = np.array(B)\nbt = b.reshape([N,1])\ncnt = 0\nfor i in range(1,N)\n if (np.dot(ai,bt) + C >0)\n cnt += 1\nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int,input().split()]\nfor i in range(1,N)\n Ai = [int,input().split()]\n ai = np.array(Ai) \nb = np.array(B)\nbt = b.reshape([N,1])\ncnt = 0\nfor i in range(1,N)\n if (np.dot(ai,bt) + C >0)\n cnt += 1\nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int(k) for k in input().split()]\nfor i in range(1,N):\n Ai = [int(j) for j in input().split()]\n ai = np.array(Ai) \nb = np.array(B)\nbt = b.reshape([M,1])\ncnt = 0\nfor i in range(1,N):\n if (np.dot(ai,bt) + C >0):\n cnt += 1\n else:\n cnt = cnt\n \nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int,input().split()]\nfor i in range(1,N):\n Ai = [int(j) for j in input().split()]\n ai = np.array(Ai) \nb = np.array(B)\nbt = b.reshape([M,1])\ncnt = 0\nfor i in range(1,N)\n if (np.dot(ai,bt) + C >0)\n cnt += 1\nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int(k) for k in input().split()]\nfor i in range(1,N):\n Ai = [int(j) for j in input().split()]\n ai = np.array(Ai) \nb = np.array(B)\nbt = b.reshape([M,1])\ncnt = 0\nfor i in range(1,N):\n if (np.dot(ai,bt) + C >0):\n cnt += 1\nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int(k) for k in input().split()]\nA = [[int(j) for j in input().split()] for i in range(1,N+1)] \nb = np.array(B)\na = np.array(A)\ncnt = 0\nfor i in range(1,N+1):\n if (np.dot(a[i],b) + C >0):\n cnt += 1\n else:\n cnt = cnt\n \nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int(k) for k in input().split()]\nfor i in range(1,N+1):\n Ai = [int(j) for j in input().split()]\n ai = np.array(Ai) \nb = np.array(B)\ncnt = 0\nfor i in range(1,N+1):\n if (np.dot(ai,b) + C >0):\n cnt += 1\n else:\n cnt = cnt\n \nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int(k) for k in input().split()]\nA = [[int(j) for j in input().split()] for i in range(1,N)] \nb = np.array(B)\na = np.array(A)\ncnt = 0\nfor i in range(1,N):\n if (np.dot(a[i],b) + C >0):\n cnt += 1\n else:\n cnt = cnt\n \nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int(k) for k in input().split()]\nfor i in range(1,N):\n Ai = [int(j) for j in input().split()]\n ai = np.array(Ai) \nb = np.array(B)\ncnt = 0\nfor i in range(1,N):\n if (np.dot(ai,b) + C >0):\n cnt += 1\n else:\n cnt = cnt\n \nprint(cnt)\n\n\n', 'import numpy as np\nN,M,C = map(int,input().split())\nB = [int(k) for k in input().split()]\nA = [[int(j) for j in input().split()] for i in range(N)] \nb = np.array(B)\ncnt = 0\nfor i in range(N):\n if (np.dot(np.array(A[i]),b) + C >0):\n cnt += 1\n else:\n cnt = cnt\n \nprint(cnt)\n\n\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s007482110', 's017492041', 's093688879', 's099048929', 's118003299', 's148297385', 's389741403', 's548623423', 's571832056', 's747097930', 's759134548', 's878571310', 's795176508'] | [13264.0, 2940.0, 2940.0, 2940.0, 2940.0, 12440.0, 2940.0, 21844.0, 21832.0, 21332.0, 12448.0, 14484.0, 12448.0] | [164.0, 18.0, 17.0, 17.0, 17.0, 156.0, 17.0, 328.0, 312.0, 307.0, 150.0, 157.0, 150.0] | [309, 291, 286, 293, 281, 344, 294, 308, 315, 325, 311, 321, 301] |
p03102 | u529012223 | 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\nN, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nB = np.array(B)\nA = []\nfor n in range(N):\n a = list(map(int, input().split()))\n A.append(a)\nA = np.array(A, dtype=int)\nB_new = np.array([B, B])\ncount = 0\nfor i in range(N):\n score = A[i] * B\n if score.sum() > C:\n count += 1\n\n\nprint(count)', 'import numpy as np\n\nN, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nB = np.array(B)\nA = []\nfor n in range(N):\n a = list(map(int, input().split()))\n A.append(a)\nA = np.array(A, dtype=int)\ncount = 0\nfor i in range(N):\n score = np.dot(A[i], B)\n if score > -C:\n count += 1\n\n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s615846755', 's084886850'] | [12424.0, 14440.0] | [150.0, 149.0] | [341, 318] |
p03102 | u532966492 | 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())\nA=[list(map(int,input().split())) for _ in range(N)]\nprint(len([i for i in range(N) if sum([A[i][j] for j in range(M)]) + C > 0]))', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nA=[list(map(int,input().split())) for _ in range(N)]\nprint(len([i for i in range(N) if sum([A[i][j]*B[j] for j in range(M)]) + C > 0]))'] | ['Wrong Answer', 'Accepted'] | ['s756313648', 's782226544'] | [3064.0, 3060.0] | [17.0, 17.0] | [161, 199] |
p03102 | u545644875 | 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()))\n\nans = 0\n\n\nfor i in range(N):\n result = 0\n A = list(map(int,input().split()))\n print(A)\n for j in range(M):\n result += A[j]*B[j]\n \n result =result + C\n if result >0:\n ans += 1\n \nprint(ans)', 'N, M, C = map(int,input().split())\nB = list(map(int,input().split()))\n\nans = 0\n\n\nfor i in range(N):\n result = 0\n A = list(map(int,input().split()))\n for j in range(M):\n result += A[j]*B[j]\n \n result =result + C\n if result >0:\n ans += 1\n \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s240125647', 's484238259'] | [3064.0, 3064.0] | [18.0, 17.0] | [273, 262] |
p03102 | u548545174 | 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 = input().split()\na = [input().split() for input() in range(n)]\n\ncnt = 0\nfor an in a:\n dot = 0\n for i, j in zip(an, b):\n dot += i*j\n dot += c\n cnt += (dot>0).astype(int)\n \nprint(cnt)', 'n, m, c = map(int, input().split())\nb = [int(x) for x in input().split()]\na = []\nfor i in range(n):\n a.append([int(x) for x in input().split()])\ncnt = 0\nfor an in a:\n dot = 0\n for i, j in zip(an, b):\n dot += i*j\n dot += c\n cnt += int(dot>0)\n \nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s977351341', 's550095701'] | [3064.0, 3064.0] | [17.0, 17.0] | [242, 278] |
p03102 | u551692187 | 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 = []\ncounter = 0\nfor i in range(N):\n A.append(list(map(int, input().split())))\n val = 0\n for j in range(M):\n val += A[i][j] * B[j]\n else:\n if val + C > 0:\n count += 1 \nprint(count)\n', 'N,M,C = map(int, input().split())\nB = list(map(int, input().split()))\nA = []\ncounter = 0\nfor i in range(N):\n A.append(list(map(int, input().split())))\n val = 0\n for j in range(M):\n val += A[i][j] * B[j]\n else:\n if val + C > 0:\n counter += 1 \nprint(counter)\n'] | ['Runtime Error', 'Accepted'] | ['s477727724', 's627131255'] | [3060.0, 3060.0] | [17.0, 18.0] | [290, 294] |
p03102 | u554954744 | 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()))\ncnt=0\nfor i in range(N):\n tmp=0\n A=list(map(int,input().split())\n for j in range(M):\n tmp+=A[j]*B[j]\n tmp+=C\n if tmp>0:\n cnt+=1\n else:\n cnt+=0\nprint(cnt)', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split())\ncnt = 0\nfor i in range(N):\n tmp=0\n A=list(map(int,input().split())\n for j in range(M):\n tmp+=A[j]*B[j]\n tmp+=C\n if tmp>0:\n cnt+=1\n else:\n cnt+=0\nprint(cnt)', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\ncnt=0\nfor i in range(N):\n tmp=0\n A=list(map(int,input().split()))\n for j in range(M):\n tmp+=A[j]*B[j]\n tmp+=C\n if tmp>0:\n cnt+=1\n else:\n cnt+=0\nprint(cnt)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s680567621', 's994093651', 's184701082'] | [2940.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0] | [256, 257, 257] |
p03102 | u555947166 | 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 = list(map(int, input().split()))\nBs = list(map(int, input().split()))\nAs = [list(map(int, input().split())) for i in range(n)]\n\ncounter = 0\nfor i in range(n):\n x = 0\n for j in range(m):\n x += As[i][j] * Bs[j]\n x += c\n if x > 0:\n counter += 1\nprint(counter)\n', 'n, m, c = list(map(int, input().split()))\nBs = list(map(int, input().split()))\nAs = [list(map(int, input().split())) for i in range(n)]\n\ncounter = 0\nfor i in range(n):\n x = 0\n for j in range(m):\n x += As[i][j] * Bs[j]\n x += c\n if x > 0:\n counter += 1\nprint(counter)\n'] | ['Wrong Answer', 'Accepted'] | ['s765035421', 's557280139'] | [3060.0, 3060.0] | [18.0, 18.0] | [296, 292] |
p03102 | u556225812 | 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=map(int,input().split())\nans=0\nfor _ in range(N): \n A = map(int, input().split())\n c=[(b*a) for a,b in zip(A,B)]\n if sum(c) - C >= 0:\n ans=ans + 1\n else:\n ans = ans\nprint(ans)', 'N,M,C=map(int,input().split()) \nB=list(map(int,input().split()))\nA =[list(map(int,input().split()))for i in range(N)]\nans=0\nfor i in range(N):\n for j in range(M):\n X+=(A[i][j]*B[i])+C\n if 0 < X:\n ans = ans+1\n else:\n ans = ans\nprint(ans)', 'N,M,C=map(int,input().split()) \nB=list(map(int,input().split()))\nA =[list(map(int,input().split()))for i in range(N)]\nans=0\nfor i in range(N):\n for j in range(M):\n X+=(A[i][j]*B[j])\n X=X+C\n if 0 < X:\n ans = ans+1\nprint(ans)\n ', 'N,M,C=map(int,input().split()) \nB=list(map(int,input().split()))\nA =[list(map(int,input().split()))for i in range(N)]\nans=0\nfor i in range(N):\n for j in range(M):\n X+=(A[i][j]*B[j])+C\n if 0 < X:\n ans = ans+1\n else:\n ans = ans\nprint(ans)\n \n', 'N,M,C=map(int,input().split()) \nB=list(map(int,input().split()))\nA =[list(map(int,input().split()))for i in range(N)]\nans=0\nfor i in range(N):\n for j in range(M):\n X+=(A[i][j]*B[j])\n X=X+C\n if 0 < X:\n ans = ans+1\n else:\n ans = ans\nprint(ans)', 'N,M,C=map(int,input().split()) \nB=map(int,input().split())\nans=0\nfor _ in range(N): \n A = map(int, input().split())\n c=[(b*a) for a,b in zip(A,B)]\n if sum(c) - C > 0:\n ans=ans + 1\n else:\n ans = ans\nprint(ans)\n ', 'n, m, c = map(int, input().split())\nblst = list(map(int, input().split()))\ncnt = 0\nfor i in range(n):\n judge = 0\n alst = list(map(int, input().split()))\n for j, k in zip(alst, blst):\n judge += j * k\n if judge + c > 0:\n cnt += 1\nprint(cnt)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s001617882', 's134226270', 's248620910', 's444157493', 's719524854', 's953266131', 's998754417'] | [3060.0, 3064.0, 3060.0, 3060.0, 3064.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [235, 267, 252, 273, 275, 239, 264] |
p03102 | u556594202 | 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\nN,M,C = map(int,input().split())\nb = np.array([int(i) for i in input().split()])\na = np.zeros(M)\nfor _ in range(N):\n a = np.vstack([a,[int(i) for i in input().split()]])\ncnt=0\nfor i in range(1,N+1):\n if sum(b-a[i])+C>0:\n cnt +=1\n\nprint(cnt)\n', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\n\ncnt=0\nfor _ in range(n):\n sum=c\n a=list(map(int,input().split()))\n for i in range(m):\n sum+=a[i]*b[i]\n\n if sum>0:\n cnt+=1\n\nprint(cnt)\n'] | ['Wrong Answer', 'Accepted'] | ['s847573406', 's552499925'] | [27208.0, 9168.0] | [123.0, 25.0] | [274, 225] |
p03102 | u556849401 | 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().strip().split())\nB = list(map(int , input().strip().split()))\nl = [];cnt = 0\nfor i in range(m):\n g = list(map(int , input().strip().split()))\n l.append(g)\n\nfor i in range(m):\n sums = 0\n for j in range(n):\n sums += l[i][j]*B[j]\n if sums + C >:\n cnt+=1\nprint(cnt)', '# -*- coding: utf-8 -*-\n"""\nCreated on Mon May 13 18:16:09 2019\n\n@author: avina\n"""\n\nN, M, C = map(int , input().strip().split())\nB = list(map(int , input().strip().split()))\nl = [];cnt = 0\nfor i in range(N):\n g = list(map(int , input().strip().split()))\n l.append(g)\nfor i in range(N):\n sums = 0\n for j in range(M):\n sums += l[i][j]*B[j]\n if sums + C > 0:\n cnt+=1\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s389948821', 's269686818'] | [2940.0, 3064.0] | [17.0, 17.0] | [300, 386] |
p03102 | u560889512 | 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())\nc=-1*c\nres=0\nstand=list(map(int,input().split()))\ndef product(i,j):\n return sum(ii+jj for ii,jj in zip(i,j))\nfor i in range(N):\n temp=list(map(int,input().split()))\n if product(stand,temp)>c:\n res+=1\nprint(res)', 'N,M,C=map(int,input().split())\nstand=list(map(int,input().split()))\ntemp=[list(map(int,input().split())) for _ in range(N)]\n\ndef product(i,j):\n return sum(ii+jj for ii,jj in zip(i,j))\n\nres=0\nfor t in temp:\n if product(stand,t)+C>0:\n res+=1\n\nprint(res)\n', 'N,M,C=map(int,input().split())\nstand=list(map(int,input().split()))\ntemp=[list(map(int,input().split())) for _ in range(N)]\n\nres=0\nfor t in temp:\n ans=0\n for i in range(M):\n ans+=stand[i]*t[i]\n if ans+C>0:\n res+=1\n\nprint(res)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s056964766', 's080917380', 's061812779'] | [3064.0, 3060.0, 3060.0] | [19.0, 18.0, 18.0] | [247, 257, 235] |
p03102 | u562400059 | 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())\n\nB = list(map(int, input().split()))\n\nA = []\nfor _ in range(N):\n temp = list(map(int, input().split()))\n A.append(temp)\n\nprint(A)\ncnt = 0\nfor a_list in A:\n sum = 0\n for a, b in zip(a_list, B):\n sum += a*b\n if sum + C > 0:\n cnt += 1\n\nprint(cnt)', 'N, M, C = map(int, input().split())\n\nB = list(map(int, input().split()))\n\nA = []\nfor _ in range(N):\n temp = list(map(int, input().split()))\n A.append(temp)\n\ncnt = 0\nfor a_list in A:\n sum = 0\n for a, b in zip(a_list, B):\n sum += a*b\n if sum + C > 0:\n cnt += 1\n\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s048333259', 's521748189'] | [3064.0, 3064.0] | [17.0, 17.0] | [308, 299] |
p03102 | u562753067 | 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 - [int(i) for i in input().split(' ')]\nb = [int(i) for i in input().split(' ')]\n\nr = 0\nfor i in range(n):\n a = [int(i) for i in input().split(' ')]\n s = 0\n for j in range(m):\n s += a[j] * b[j]\n s += c\n if s > 0:\n r += 1\n \nprint(r)", "n, m, c = [int(i) for i in input().split(' ')]\nb = [int(i) for i in input().split(' ')]\n \nr = 0\nfor i in range(n):\n a = [int(i) for i in input().split(' ')]\n s = 0\n for j in range(m):\n s += a[j] * b[j]\n s += c\n if s > 0:\n r += 1\n \nprint(r)"] | ['Runtime Error', 'Accepted'] | ['s040128977', 's341044087'] | [3064.0, 3060.0] | [17.0, 17.0] | [250, 251] |
p03102 | u571445182 | 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\nTmp = []\nTmp = input().rstrip().split(' ')\n\nnN = int(Tmp[0])\nnM = int(Tmp[1])\nnC = int(Tmp[2])\nnAns = 0\nListA = []\nListB = []\nListB += list(map(int,input().split()))\nnAns = 0\n\nfor i in range(nN):\n ListA += list(map(int,input().split()))\n nTmp = np.dot(ListA, ListB.T)\n nTmp += nC\n if nTmp > 0:\n nAns += 1\n\nprint(nAns)\n\n", "import numpy as np\n \nTmp = []\nTmp = input().rstrip().split(' ')\n \nnN = int(Tmp[0])\nnM = int(Tmp[1])\nnC = int(Tmp[2])\nnAns = 0\nListA = [0 for i in range(nM)]\nListB = [0 for i in range(nM)]\nTmp = input().rstrip().split(' ')\nfor i in range(nM):\n ListB[i] = int(Tmp[i])\nnAns = 0\n \nfor i in range(nN):\n Tmp = input().rstrip().split(' ')\n for j in range(nM):\n ListA[j] = int(Tmp[j])\n\n \n# nTmp = np.dot(ListA, ListB.T)\n nTmp = 0\n for j in range(nM):\n nTmp += ListA[j] * ListB[j]\n nTmp += nC\n if nTmp > 0:\n nAns += 1\n\nprint(nAns)\n "] | ['Runtime Error', 'Accepted'] | ['s427531766', 's398679363'] | [19876.0, 12400.0] | [310.0, 149.0] | [346, 543] |
p03102 | u580697892 | 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. | ['#coding: utf-8\nN, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = list(map(int, input().split())) for _ in range(N))\nl []\nfor i in range(N):\n A = list(map(int, input().split()))\n l.append(sum(A[j] * B[j] for j in range(M)) + C > 0)\nprint(l)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nl = []\nfor i in range(N):\n l.append(list(map(int, input().split())))\nfor j in range(N):\n sum_ = [l[j][i] * B[i] for i in range(M)]\nprint(sum([sum_[i] > -C for i in range(N)]))', '#coding: utf-8\nN, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nl = []\nfor i in range(N):\n A = list(map(int, input().split()))\n l.append(sum(A[j] * B[j] for j in range(M)) + C > 0)\nprint(sum(l))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s051478177', 's214169573', 's802795858'] | [2940.0, 3064.0, 3060.0] | [18.0, 20.0, 18.0] | [271, 253, 223] |
p03102 | u581603131 | 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 = [list(map(int, input().split())) for i in range(N)]\ncount = 0\ncal = 0\nfor i in range(N):\n for k in range(M):\n cal = A[i][k]*B[k]\n if cal + C > 0:\n count += 1\nprint(count)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\na = 0\nsum = 0\nfor i in range(N):\n \tA = list(map(int, input().split()))\n for j in range(M):\n sum += A[j] * B[j]\n if sum + C > 0:\n a += 1\n sum = 0\n else :\n sum = 0\nprint(a)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\na = 0\nsum = 0\nfor i in range(N):\n\tA = list(map(int, input().split()))\n for j in range(M):\n sum += A[i][j] * B[j]\n if sum + C > 0:\n a += 1\n sum = 0\n else :\n sum = 0\nprint(a)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\na = 0\nsum = 0\nfor i in range(N):\n\tA = list(map(int, input().split()))\n for j in range(M):\n sum += A[j] * B[j]\n if sum + C > 0:\n a += 1\n sum = 0\n else :\n sum = 0\nprint(a)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\na = 0\nsum = 0\nfor i in range(N):\n A = list(map(int, input().split()))\n for j in range(M):\n sum += A[i][j] * B[j]\n if sum + C > 0:\n a += 1\n sum = 0\n else :\n sum = 0\nprint(a)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\na = 0\nsum = 0\nfor i in range(N):\n A = list(map(int, input().split()))\n for j in range(M):\n sum += A[i][j] * B[j]\n if sum + C > 0:\n a += 1\n sum = 0\n else :\n sum = 0\nprint(a)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\na = 0\nsum = 0\nfor i in range(N):\n A = list(map(int, input().split()))\n for j in range(M):\n sum += A[j] * B[j]\n if sum + C > 0:\n a += 1\n sum = 0\n else :\n sum = 0\nprint(a)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = [list(map(int, input().split())) for i in range(N)]\ncount = 0\ncal = 0\nfor i in range(N):\n for k in range(M):\n cal = A[i][k]*B[k]\n if cal + C > 0:\n count += 1\nprint(count)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = [list(map(int, input().split())) for i in range(N)]\ncount = 0\ncal = 0\nfor i in range(N):\n for k in range(M):\n cal += A[i][k]*B[k]\n if cal + C > 0:\n count += 1\n cal = 0\n else: \n \tcal =0\nprint(count)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s042458775', 's063455764', 's187018819', 's319533724', 's491015216', 's653440959', 's791888621', 's968160270', 's923666378'] | [3064.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 3064.0, 3064.0] | [19.0, 17.0, 18.0, 17.0, 18.0, 17.0, 17.0, 18.0, 17.0] | [266, 280, 281, 278, 284, 284, 279, 270, 306] |
p03102 | u598229387 | 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(i) for i in input().split()]\na = [[int(i) for i in input().split()] for j in range(n)]\ncheck = 0\nans = 0\nfor i in range(n):\n for j in range(m):\n check += a[i][j]*b[j]\n check += 0\n if check > 0:\n ans += 1\nprint(ans)\n ', 'n, m, c = map(int, input().split())\nb = [int(i) for i in input().split()]\na = [[int(i) for i in input().split()] for j in range(n)]\ncheck = c\nans = 0\nfor i in range(n):\n for j in range(m):\n check += a[i][j]*b[j]\n if check > 0:\n ans += 1\n check = c\nprint(ans)\n '] | ['Wrong Answer', 'Accepted'] | ['s313161539', 's712118041'] | [3064.0, 3064.0] | [18.0, 18.0] | [291, 290] |
p03102 | u598726179 | 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 = list(map(int, input().split()))\nB = list(map(int, input().split()))\nA = [list(map(int, input().split())) for i in range(N)]\ncnt = 0\nfor x in A:\n total = sum([A[i]*B[i] for i in range(M)])\n total += C\n if total > 0:\n cnt+= 1\n \nprint(cnt)', 'N, M, C = list(map(int, input().split()))\nB = list(map(int, input().split()))\nA = [list(map(int, input().split())) for i in range(N)]\ncnt = 0\nfor x in A:\n total = sum([x[i]*B[i] for i in range(M)])\n total += C\n if total > 0:\n cnt+= 1\n \nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s961557535', 's256049859'] | [3316.0, 3064.0] | [18.0, 18.0] | [255, 255] |
p03102 | u601992815 | 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())\nBn = map(int,input().split())\nans=0\nfor n in range(N):\n As = map(int,input().split())\n if sum([x*y for (x,y) in zip(As,Bn)])>C:\n ans+=1\nprint(ans)\n ', 'N,M,C = map(int,input().split())\nBn = list(map(int,input().split()))\nans=0\nnums = []\nfor n in range(N):\n As = list(map(int,input().split()))\n if sum([x*y for (x,y) in zip(As,Bn)])+C>0:\n ans+=1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s812042555', 's160813846'] | [2940.0, 3060.0] | [18.0, 20.0] | [201, 217] |
p03102 | u607741489 | 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()))\nans=0\nfor i in range(n):\n tmp=0\n for j in range(m):\n a = int(input())\n tmp += a * b[j]\n tmp -= c\n if(tmp>0):\n ans += 1\n\nprint(ans)', 'n,m,c = map(int,input().split())\nb = list(map(int,input().split()))\nans=0\nfor i in range(n):\n tmp=0\n a = list(map(int, input().split()))\n for j in range(m):\n tmp += a[j] * b[j]\n tmp += c\n if(tmp>0):\n ans += 1\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s884666308', 's793671037'] | [3060.0, 3064.0] | [17.0, 17.0] | [231, 249] |
p03102 | u609814378 | 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. | ['a', 'N,M,C = map(int, input().split())\nB = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(N):\n A = list(map(int, input().split()))\n check = C\n\n for i,j in zip(A,B):\n check = check + (i*j)\n\n if check > 0:\n ans = ans + 1\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s742924004', 's157677766'] | [2940.0, 3060.0] | [17.0, 18.0] | [1, 261] |
p03102 | u612721349 | 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())\nbl = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n al = [int(j) for j in input().split()]\n ans += sum([bl[j] * al[j] for j in range(m)) + c > 0\nprint(ans)', 'n, m, c = map(int, input().split())\nbl = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n al = [int(j) for j in input().split()]\n ans += sum([bl[j] * al[j] for j in range(m)]) + c > 0\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s987770180', 's518790898'] | [2940.0, 3060.0] | [17.0, 17.0] | [208, 209] |
p03102 | u620846115 | 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()))\ncount = 0\nfor i in range(N):\n a = list(map(int,input().split()))\n for j in range(M):\n P = C \n P += B[j]*a[j]\n if P>0:\n count+=1\nprint(count)', 'N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\ncount = 0\nfor i in range(N):\n a = list(int,input().split())\n for j in range(M):\n P = C \n P += B[j]*a[j]\n if P>0:\n count+=1\nprint(count)', 'N,M,C = map(int,input().split())\nB = list(int,input().split())\ncount = -\nfor i in range(N):\n a = list(int,input().split())\n for i in range(M)\n if sum(B[i]*a[i])+C>0:\n count+=1\nprint(count)', 'N,M,C = map(int,input().split())\nB = list(int,input().split())\ncount = 0\nfor i in range(N):\n a = list(int,input().split())\n for i in range(M):\n s += B[i]*a[i]\n if s+C>0:\n count+=1\nprint(count)', 'N,M,C = map(int,input().split())\nB = list(int,input().split())\ncount = 0\nfor i in range(N):\n a = list(int,input().split())\n for j in range(M):\n P = C \n P += B[j]*a[j]\n if P>0:\n count+=1\nprint(count)', 'N,M,C = map(int,input().split())\nB = list(int,input().split())\ncount = -\nfor i in range(N):\n a = list(int,input().split())\n for i in range(M)\n if sum(B[i]*a[i])+C=0:\n count+=1\nprint(count)', 'N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\ncount = 0\nfor i in range(N):\n a = list(map(int,input().split()))\n P = C \n for j in range(M):\n P += B[j]*a[j]\n if P>0:\n count+=1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s041192692', 's262682043', 's417536484', 's594957336', 's875728887', 's945702291', 's108009432'] | [9028.0, 8932.0, 9016.0, 9132.0, 9032.0, 8844.0, 9096.0] | [22.0, 28.0, 25.0, 25.0, 24.0, 25.0, 32.0] | [217, 212, 194, 201, 207, 194, 219] |
p03102 | u620945921 | 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 = [int(i) for i in input().split()]\ne = [[int(i) for i in input().split()] for i in range(1+n)]\n\ncount=0\nfor j in range(1,n+1):\n tmp=0\n for i in range(1,m):\n tmp+=e[j][i]*e[0][i]\n if tmp>c:\n count+=1\n \nprint(count)\n\n', 'n,m,c = [int(i) for i in input().split()]\ne = [[int(i) for i in input().split()] for i in range(1+n)]\n\ncount=0\ntmp=0\n\nfor j in range(1,n+1):\n for i in range(1,m):\n tmp+=e[j][i]*e[0][i]\n if tmp>c:\n count+=1\n \nprint(count)', 'n,m,c = [int(i) for i in input().split()]\ne = [[int(i) for i in input().split()] for i in range(1+n)]\n\ncount=0\nfor j in range(1,n+1):\n tmp=0\n for i in range(0,m):\n tmp+=e[j][i]*e[0][i]\n# print(tmp)\n if tmp+c>0:\n count+=1\n \nprint(count)\n\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s468353203', 's498432858', 's338805937'] | [3060.0, 3060.0, 3060.0] | [17.0, 20.0, 17.0] | [234, 231, 250] |
p03102 | u623036684 | 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\nN, M, C = map(int, input().split())\nprint(N,M,C)\n\nM=[int(x) for x in input().split()]\n\nnlist=[]\n\nfor i in range(N):\n nlist.append([int(x) for x in input().split()])\n\nnlist=np.array(nlist)\nM= np.array(M)\nans=(nlist*M+C).sum(axis=1)\nprint((ans>0).sum())', 'import numpy as np\n\nN, M, C = map(int, input().split())\nM=[int(x) for x in input().split()]\nnlist=[]\nfor i in range(N):\n nlist.append([int(x) for x in input().split()])\n\nnlist=np.array(nlist)\nM= np.array(M)\nans=(nlist*M+C).sum(axis=1)\nprint((ans>0).sum())', 'import numpy as np\n\nN, M, C = map(int, input().split())\nM=[int(x) for x in input().split()]\nnlist=[]\n\nfor i in range(N):\n nlist.append([int(x) for x in input().split()])\n\nnlist=np.array(nlist)\nM= np.array(M)\nans=(nlist*M).sum(axis=1)+C\nprint((ans>0).sum())'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s537114250', 's968035081', 's445231388'] | [12448.0, 12448.0, 12448.0] | [149.0, 150.0, 151.0] | [274, 258, 259] |
p03102 | u624814920 | 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=[list(map(int, input().split()))for i in range(n)]\ncnt = 0\nfor i in range(n):\n total = 0\n for j in range(m):\n total += b[j] * a[i][j]\n total += c\n if total > 0:\n cnt += 1\nprint(cnt)', 'n, m, c = map(int, input().split()\nB = list(map(int, input().split()))\nA = [list(map(int, input().split()))for i in range(n)]\ncnt = 0\nfor i in range(n):\n total = 0\n for j in range(m):\n total += b[j] * a[i][j]\n total += c\n if total > 0:\n cnt += 1\nprint(cnt)\n', 'n,m,c=map(int,input().split())\nB=list(map(int,input().split()))\nA=[list(map(int, input().split()))for i in range(n)]\ncnt = 0\nfor i in range(n):\n total = 0\n for j in range(m):\n total += B[j] * A[i][j]\n total += c\n if total > 0:\n cnt += 1\nprint(cnt)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s658900562', 's879985902', 's328020050'] | [3064.0, 2940.0, 3064.0] | [18.0, 17.0, 17.0] | [257, 267, 257] |
p03102 | u626337957 | 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 = [list(map(int, input().split())) for j in range(N)]\n\nans = 0\nfor elem in A:\n sum_A = 0\n for j in range(M):\n sum_A += elem[i] * B[i]\n if sum_A + C > 0:\n ans += 1\nprint(ans)\n \n ', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = [list(map(int, input().split())) for j in range(N)]\n\nans = 0\nfor elem in A:\n sum_A = 0\n for j in range(M):\n sum_A += elem[j] * B[j]\n if sum_A + C > 0:\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s812243306', 's710051029'] | [3060.0, 3060.0] | [18.0, 18.0] | [264, 256] |
p03102 | u631019293 | 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=list(map(int,input().split() for _ in range(N))\nab=list(range(N))\ncount=0\n\nfor i in range(N):\n for j in range(M):\n ab[i]+=a[i][j]*b[j]\n if ab[i]+C>0:\n count+=1\nprint(count)', 'N,M,C=map(int,input().split())\nb=list(map(int,input().split()))\na=list(map(int,input().split()) for _ in range(N))\nab=list(range(N))\ncount=0\n\nfor i in range(N):\n for j in range(M):\n ab[i]+=a[i][j]*b[j]\n if ab[i]+C>0:\n count+=1\n\nprint(count)\n', 'N,M,C=map(int,input().split())\nb=list(map(int,input().split()))\na=list(range(N))\nfor i in range(N):\n a[i]=list(map(int,input().split()))\nab=list(range(N))\ncount=0\n\nfor i in range(N):\n for j in range(M):\n ab[i]=0\n ab[i]+=a[i][j]*b[j]\n if ab[i]+C>0:\n count+=1\n\nprint(count)\nprint(ab)\n', 'N,M,C=map(int,input().split())\nb=list(map(int,input().split()))\na=list(range(N))\nfor i in range(N):\n a[i]=list(map(int,input().split()))\nab=list(range(N))\ncount=0\n\nfor i in range(N):\n ab[i]=0\n for j in range(M):\n ab[i]+=a[i][j]*b[j]\n if ab[i]+C>0:\n count+=1\n\nprint(count)\nprint(ab)\n', 'N,M,C=map(int,input().split())\nb=list(map(int,input().split()))\na=list(range(N))\nfor i in range(N):\n a[i]=list(map(int,input().split()))\nab=list(range(N))\ncount=0\n\nfor i in range(N):\n ab[i]=0\n for j in range(M):\n ab[i]+=a[i][j]*b[j]\n if ab[i]+C>0:\n count+=1\n\nprint(count)\n'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s162600417', 's180528394', 's311950379', 's880583387', 's170076467'] | [2940.0, 3060.0, 3188.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 19.0, 17.0] | [258, 261, 312, 308, 298] |
p03102 | u633548583 | 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())\ncount=0\nfor i in range(m):\n b=list(map(int,input().split()))\n for j in range(1,n):\n a=list(map(int,input().split()))\n combined=[x*y for (x,y) in zip(a,b)]\n if sum(combined)>c:\n count+=1\nprint(count)\n ', 'n,m,c=map(int,input().split())\ncount=0\nfor i in range(m):\n b=list(map(int,input().split()))\n for j in range(n):\n a=list(map(int,input().split()))\n combined=[x*y for (x,y) in zip(a,b)]\n if sum(combined)>c:\n count+=1\nprint(count)\n \n', 'n,m,c=map(int,input().split())\nsum=0\ncount=0\nfor i in range(m):\n b=list(map(int,input().split()))\n a=list(map(int,input().split()))\n sum+=b[i]*a[i]\nfor j in range(n):\n if sum>-c:\n count+=1\nprint(count)', 'n,m,c=map(int,input().split())\ncount=0\nfor i in range(m):\n b=list(map(int,input().split()))\nfor j in range(n):\n a=list(map(int,input().split()))\n combined=[x*y for (x,y) in zip(a,b)]\n if sum(combined)>c:\n count+=1\nprint(count)\n \n', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\ncount=0\nfor i in range(n):\n a=list(map(int,input().split()))\n p=c\n for j in range(m):\n p+=a[j]*b[j]\n if p>0:\n count+=1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s396492752', 's542847521', 's789313344', 's980110416', 's210325809'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0, 17.0, 18.0] | [272, 271, 220, 251, 221] |
p03102 | u637593381 | 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\nn, m, c = map(int, input().split())\n\nmp = np.zeros((w, h))\nb = list(map(int, input().split()))\nnum = 0\n\nfor i in range(n):\n A = list(map(int, input().split()))\n npb = np.array(b)\n npA = np.array(A)\n if np.dot(npA.T, npb) + c > 0:\n num++\n \nprint(num)', 'import numpy as np\n \nn, m, c = map(int, input().split())\n \nmp = np.zeros((w, h))\nb = list(map(int, input().split()))\nnum = 0\n \nfor i in range(n):\n A = list(map(int, input().split()))\n npb = np.array(b)\n npA = np.array(A)\n if np.dot(npA.T, npb) + c > 0:\n num += 1\n \nprint(num)', 'import numpy as np\n \nn, m, c = map(int, input().split())\n \nb = list(map(int, input().split()))\nnum = 0\n \nfor i in range(n):\n A = list(map(int, input().split()))\n npb = np.array(b)\n npA = np.array(A)\n if np.dot(npA.T, npb) + c > 0:\n num += 1\n \nprint(num)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s059751507', 's816522369', 's013429355'] | [2940.0, 12488.0, 21148.0] | [17.0, 150.0, 306.0] | [279, 285, 263] |
p03102 | u642528832 | 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())\n\nbl = list(map(int,input().split()))\nal = [list(map(int,input().split())) for i in range(n)]\ncnt = 0\n\nfor i in range(n):\n total = 0\n for j in range(m):\n total+=bl[j]*al[i][j]\n total+=c\n if 0 < total:\n cnt+=1\nprint(cnt)\n\n', 'n,m,c = map(int,input().split())\n\nbl = list(map(int,input().split()))\nal = [list(map(int,input().split())) for i in range(n)]\ncnt = 0\n\nfor i in range(n):\n total = 0\n for j in range(m):\n total+=bl[j]*al[i][j]\n total+=c\n if 0 < total:\n cnt+=1\nprint(cnt)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s506156822', 's233208062'] | [9108.0, 9192.0] | [25.0, 28.0] | [291, 279] |
p03102 | u644778646 | 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())\nab = {}\nfor i in range(N):\n a,b = map(int,input().split())\n if a in ab.keys():\n ab[a] += b\n continue\n ab[a] = b\n\nkeys = sorted(ab.keys())\n\nans = 0\nkosu = 0\nfor k in keys:\n kosu += ab[k]\n if kosu >= M:\n kosu -= ab[k]\n break\n ans += k * ab[k]\n\nfor i in range(ab[k]):\n if kosu == M:\n break\n kosu += 1\n ans += k\nprint(ans)\n', 'N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\nA = []\nfor i in range(N):\n A.append(list(map(int,input().split())))\n\nans = 0\nfor i in range(N):\n tmp = 0\n for j in range(M):\n tmp += A[i][j]*B[j]\n tmp += C\n if tmp > 0:\n ans += 1\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s845623679', 's488823026'] | [3064.0, 3060.0] | [17.0, 17.0] | [414, 287] |
p03102 | u652892331 | 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(i) for i in input().split()]\nA = [list(map(int, input().split())) for i in range(n)]\n\ncount = 0\nfor low in range(n):\n Sum = c\n for col in range(m):\n Sum += A[low][col]*B[col]\n\n if Sum >= 0:\n count += 1\n\nprint(count)', 'n, m, c = map(int, input().split())\nB = [int(i) for i in input().split()]\nA = [list(map(int, input().split())) for i in range(n)]\n\ncount = 0\nfor low in range(n):\n Sum = c\n for col in range(m):\n Sum += A[low][col]*B[col]\n\n if Sum > 0:\n count += 1\n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s105527968', 's731989932'] | [3064.0, 3064.0] | [18.0, 18.0] | [283, 282] |
p03102 | u658627575 | 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 = {}\nA = {}\n\nB.append(map(int, input().split())\nfor i in range(N):\n\tA.append(list(map(int, input().split())))\n\n\nsum = 0\ncount = 0\n\nfor i in range(N):\n\tsum = 0\n\tfor j in range(M):\n\t\tsum += A[i][j]\n\t\tsum += B[j]\n\tsum += C\n\tif sum > 0:\n\t\tcount += 1\n\nprint(count)', 'N, M, C = map(int, input().split())\nB = {}\nA = {}\n\nB.append(map(int, input().split())\nfor i in range(N):\n\tA.append(list(map(int, input().split())))\n\n\nsum = 0\ncount + 0\n\nfor i in range(N):\n\tsum = 0\n\tfor j in range(M):\n\t\tsum += A[i][j]\n\t\tsum += B[j]\n\tsum += C\n\tif sum > 0:\n\t\tcount += 1\n\nprint(sum)', 'N, M, C = map(int, input().split())\nB = []\nA = []\n\nB.append(map(int, input().split())\nfor i in range(N):\n\tA.append(list(map(int, input().split())))\n\n\nsum = 0\ncount = 0\n\nfor i in range(N):\n\tsum = 0\n\tfor j in range(M):\n\t\tsum += A[i][j]\n\t\tsum += B[j]\n\tsum += C\n\tif sum > 0:\n\t\tcount += 1\n\nprint(sum)', '\n#test_data = open("test.txt", "r")\n\n\n#line = test_data.readline()\n\n\n#N, M, C = map(int, line.split())\nN, M, C = map(int, input().split())\nB = []\nA = []\n\n#line = test_data.readline()\n\n\n#B = [int(b) for b in line.split()]\nB = [int(b) for b in input().split()]\nfor i in range(N):\n\tA.append(list(map(int, input().split())))\n\t#line = test_data.readline()\n\t#A.append(list(map(int, line.split())))\n\nsum = 0\ncount = 0\n\nfor i in range(N):\n\tsum = 0\n\tfor j in range(M):\n\t\tsum += A[i][j] * B[j]\n\tsum += C\n\tif sum > 0:\n\t\tcount += 1\n\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s282574697', 's549604452', 's557107869', 's920126053'] | [2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 17.0, 18.0, 17.0] | [297, 295, 295, 633] |
p03102 | u663438907 | 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 = []\nA.append(list([int(input()) for _ in range(N)]))\n\nprint(A)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = []\nA.append([list(map(int, input().split())) for _ in range(N)])\nans = 0 \ntemp = 0\n\nfor i in range(N):\n for j in range(M):\n temp += B[j] * A[0][i][j]\n if temp + C > 0:\n ans += 1\n temp = 0\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s252739206', 's290948860'] | [2940.0, 3064.0] | [17.0, 17.0] | [137, 285] |
p03102 | u664796535 | 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 = [list(map(int, input().split())) for _ in range(n)]\n\nres = 0\nfor p in a:\n if sum(i+j for i,j in zip(p,b)) + c > 0:\n res += 1\nreturn res', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for _ in range(n)]\n\nres = 0\nfor p in a:\n if sum(i+j for i,j in zip(p,b)) + c > 0:\n res += 1\nprint(res)', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for _ in range(n)]\n\nres = 0\nfor p in a:\n if sum(i*j for i,j in zip(p,b)) + c > 0:\n res += 1\nprint(res)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s215744979', 's310136013', 's815898789'] | [3060.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0] | [215, 215, 215] |
p03102 | u665038048 | 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 = []\ncorrect_num = 0\nfor i in range(N):\n a.append(map(int, input().split()))\n sum = 0\n for j in range(M):\n sum + =a[i][j] * B[j]\n if sum > 0:\n correct_num += 1\n else:\n pass\nprint(sum)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\na = []\ncorrect_num = 0\nfor i in range(N):\n a.append(list(map(int, input().split())))\n sum = 0\n for j in range(M):\n sum += a[i][j] * B[j]\n if sum + C > 0:\n correct_num += 1\n else:\n pass\nprint(correct_num)'] | ['Runtime Error', 'Accepted'] | ['s702476238', 's402861024'] | [2940.0, 3060.0] | [18.0, 18.0] | [293, 311] |
p03102 | u667024514 | 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()))\nans = 0\nfor i in range(n):\n num = c\n lis = list(map(int,input().split()))\n for j in range(m):\n num += b[j] * lis[i]\n if num > 0:ans += 1\nprint(ans)', 'n,m,c = map(int,input().split())\nb = list(map(int,input().split()))\nans = 0\nfor i in range(n):\n num = c\n lis = list(map(int,input().split()))\n for j in range(m):\n num += b[j] * lis[j]\n if num > 0:ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s522209051', 's861691574'] | [3060.0, 3060.0] | [17.0, 17.0] | [234, 234] |
p03102 | u670180528 | 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. | ['I=lambda:map(int,input().split())\nn,m,c=I()\nb=list(I())\nA=[];c=0\nA+=list(I())\nfor a in A:\n d=0\n for i,j in zip(b,a):\n d+=i*j\n c+=(c+d>0)\nprint(c)', 'I=lambda:map(int,input().split())\nn,m,c=I();B=list(I());e=0\nfor t in range(n):\n d=0\n for a,b in zip(list(I()),B):d+=a*b\n e+=(d+c>0)\nprint(e)'] | ['Runtime Error', 'Accepted'] | ['s177346784', 's581616376'] | [3060.0, 2940.0] | [17.0, 18.0] | [151, 143] |
p03102 | u677393869 | 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()))\nX=0\nY=0\nfor i in range(N):\n A=list(map(int,input().split()))\n for i in range(N):\n Y+=A[i]*B[i]\n Y=Y+C\n if Y>0:\n X+=1\nprint(X)', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nX=0\nfor i in range(N):\n A=list(map(int,input().split()))\n Y=0\n for i in range(M):\n Y+=A[i]*B[i]\n Y=Y+C\n if Y>0:\n X+=1\n else:\n pass\nprint(X)'] | ['Runtime Error', 'Accepted'] | ['s781085958', 's837059904'] | [3060.0, 3060.0] | [17.0, 17.0] | [199, 218] |
p03102 | u684695949 | 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_lst = map(int,input().split())\ncount=0\nfor _ in range(N):\n\tA_lst = map(int,input().split())\n\tans = C\n\tfor a,b in zip(A_lst,B_lst):\n\t\tans += a*b\n\tif ans > 0:\n\t\tcount += 1\nprint(count)\n', 'N,M,C = map(int,input().split())\nB_lst = list(map(int,input().split()))\ncount=0\nfor _ in range(N):\n\tA_lst = list(map(int,input().split()))\n\tans = C\n\tfor a,b in zip(A_lst,B_lst):\n\t\tans += a*b\n\tif ans > 0:\n\t\tcount += 1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s699227554', 's401887976'] | [2940.0, 3060.0] | [17.0, 17.0] | [218, 229] |
p03102 | u686036872 | 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))\n', 'N, M, C = map(int, input().split())\nB=list(map(int, input().split))\nanswer=0\nsum=0 \nfor i in range(N):\n A=list(map(int, input().split))\n for j in range(M):\n sum+=B[j]*A[j]\n if (sum+C)>0:\n answer+=1\nprint(answer)', 'N, M, C = map(int, input().split())\nB=list(map(int, input().split()))\nanswer=0\nsum=0 \n', 'N, M, C = map(int, input().split())\nB=list(map(int, input().split()))\nanswer=0\nsum=0 \nfor i in range(N):\n A=list(map(int, input().split())\n for j in range(M):\n sum+=B[j]*A[j]\n if (sum+C)>0:\n answer+=1\nprint(answer)', 'N, 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 for j in range(M):\n sum+=B[j]*A[j]\n if (sum+C)>0:\n answer+=1\nprint(answer)\n', 'N, M, C = map(int, input().split())\nB=list(map(int, input().split))\nanswer=0\nsum=0 \n', 'N, M, C = map(int, input().split())\nB=list(map(int, input().split))\nanswer=0\nfor i in range(N):\n A=list(map(int, input().split))\n for j in range(M):\n sum+=B[j]*A[j]\n if (sum+C)>0:\n answer+=1\nprint(answer)', 'N, M, C = map(int, input().split())\nB=list(map(int, input().split))\nanswer=0\nsum=0 \nfor i in range(N):\n A=list(map(int, input().split))\n for j in range(M):\n sum+=B[j]*A[j]\n if (sum+C)>0:\n answer+=1\nprint(answer)', '\nN, M, C = map(int, input().split())\nB=list(map(int, input().split))\nanswer=0\nfor i in range(N):\n A=list(map(int, input().split))\n for j in range(M):\n sum+=B[j]*A[j]\n if (sum+C)>0:\n answer+=1\nprint(answer)', 'N, 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 for j in range(M):\n sum=sum(B[j]*A[j])\n if sum+C>0:\n answer+=1\nprint(answer)\n', 'N, M, C = map(int, input().split())\nB=list(map(int, input().split()))\nanswer=0\nsum=0 \nfor i in range(N):\n A=list(map(int, input().split))\n for j in range(M):\n sum+=B[j]*A[j]\n if (sum+C)>0:\n answer+=1\nprint(answer)', 'N, M, C = map(int, input().split())\nB=list(map(int, input().split()))\nanswer=0\nfor i in range(N):\n A=list(map(int, input().split()))\n sum=C\n for j in range(M):\n sum+=B[j]*A[j]\n if sum>0:\n answer+=1\nprint(answer)'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s087864058', 's122070046', 's127795148', 's193089764', 's216237058', 's274591049', 's321855663', 's566413687', 's667761973', 's712216081', 's723991865', 's153698545'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 3064.0, 3060.0] | [17.0, 18.0, 19.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [68, 219, 87, 224, 203, 85, 211, 221, 212, 205, 223, 221] |
p03102 | u687766076 | 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\nn, m, c = map(int, sys.stdin.readline().split())\nblist = list([int(i)-1 for i in sys.stdin.readline().split()])\n\nans = 0\nfor _ in range(n):\n tmp = list([int(i)-1 for i in sys.stdin.readline().split()])\n check = c\n for i in range(m):\n check += tmp[i] * blist[i]\n if check > 0:\n ans += 1\n\nprint(ans)\n', 'import sys\n\nn, m, c = map(int, sys.stdin.readline().split())\nblist = list([int(i) for i in sys.stdin.readline().split()])\n\nans = 0\nfor _ in range(n):\n tmp = list([int(i) for i in sys.stdin.readline().split()])\n check = c\n for i in range(m):\n check += tmp[i] * blist[i]\n if check > 0:\n ans += 1\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s247412427', 's042930125'] | [3060.0, 3060.0] | [17.0, 18.0] | [336, 332] |
p03102 | u691018832 | 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()))\nans = 0\ncode = 0\n\nfor i in range(n):\n for j in range(m):\n \n a = list(map(int, input.split()))\n code += a[j] * b[j]\n \n code -= 10\n if code >= 0:\n ans += 1\n \nprint(ans)', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\nans = 0\ncode = 0\n\nfor i in range(n):\n a = list(map(int, input().split()))\n \n for j in range(m):\n code += a[j] * b[j]\n \n code -= c\n if code > 0:\n ans += 1\n code = 0\n\nprint(ans)\n', 'n, m, c = map(int, input.split())\nb = list(map(int, input.split()))\nans = 0\ncode = 0\n\nfor i in range(n):\n for j in range(m):\n \n a = list(map(int, input.split()))\n code += a[i] * b[i]\n \n code -= 10\n if code >= 0:\n ans += 1\n \nprint(ans)', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\nans = 0\ncode = 0\n\nfor i in range(n):\n a = list(map(int, input().split()))\n \n for j in range(m):\n code += a[j] * b[j]\n \n code -= c\n if code > 0:\n ans += 1\n \nprint(ans)\n', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\nans = 0\ncode = 0\n\nfor i in range(n):\n a = list(map(int, input().split()))\n \n for j in range(m):\n code += a[j] * b[j]\n \n code += c\n if code > 0:\n ans += 1\n code = 0\n \nprint(ans)\n'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s077552101', 's255205456', 's514462902', 's579413306', 's197346868'] | [3060.0, 3060.0, 3060.0, 3060.0, 2940.0] | [18.0, 18.0, 17.0, 19.0, 17.0] | [281, 283, 281, 278, 291] |
p03102 | u691896522 | 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 = list(map(int ,input().split()))\nb = list(map(int ,input().split()))\nA = []\nfor i in range(n):\n A.appened(list(map(int ,input().split())))\ncount = 0\nfor i in range(n):\n sum = 0\n for j in range(m):\n sum += (b[m] * A[n][m])\n if sum + c > 0:\n count += 1\nprint(count)', 'n, m, c = list(map(int ,input().split()))\nb = list(map(int ,input().split()))\nA = []\nfor i in range(n):\n A.append(list(map(int ,input().split())))\ncount = 0\nfor i in range(n):\n sum = 0\n for j in range(m):\n sum += (b[j] * A[i][j])\n if sum + c > 0:\n count += 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s795912096', 's387405642'] | [3064.0, 3188.0] | [17.0, 19.0] | [298, 297] |
p03102 | u692514846 | 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 = [list(map(int input().split())) for i in range(N)]\nM = list(range(N))\nx = 0\nfor i in M:\n M[i] = A[i] * B[I] + C\n if M[i] > 0:\n x +=\nprint(x)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = [list(map(int, input().split())) for i in range(N)]\ncount = 0\nfor i in range(N):\n s = C\n for j in range(M):\n s += A[i][j] * B[j]\n if s > 0:\n count += 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s321104754', 's576711835'] | [2940.0, 3060.0] | [20.0, 17.0] | [227, 263] |
p03102 | u704252625 | 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 functools import reduce\nN, M, C = map(int, input().split())\nB = map(int, input().split())\ncount = 0\nfor _ in range(N):\n\tif 0 < C + reduce(lambda acc, p: acc + p[0]*p[1], zip(map(int, input().split()), B), 0):\n\t\tcount += 1\nprint(count)\n', 'from functools import reduce\nN, M, C = map(int, input().split())\nB = map(int, input().split())\ncount = 0\nfor _ in range(N):\n \tif 0 < C + reduce(lambda p: p[0]*p[1], zip(map(int, input().split()), B)):\n \tcount += 1\nprint(count)', 'from functools import reduce\nN, M, C = map(int, input().split())\nB = map(int, input().split())\ncount = 0\nfor _ in range(N):\n \tif 0 < C + reduce(lambda p: p[0]*p[1], zip(map(int, input().split()), B)):\n count += 1\nprint(count)', 'from functools import reduce\nN, M, C = map(int, input().split())\n*B, = map(int, input().split())\ncount = 0\nfor _ in range(N):\n\tif 0 < C + reduce(lambda acc, p: acc + p[0]*p[1], zip(map(int, input().split()), B), 0):\n\t\tcount += 1\nprint(count)\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s053221596', 's303537349', 's502973826', 's050370937'] | [3700.0, 2940.0, 2940.0, 3572.0] | [30.0, 17.0, 18.0, 22.0] | [240, 230, 233, 242] |
p03102 | u711238850 | 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 main():\n n,m,c = tuple([int(t)for t in input().split()])\n\tb = tuple([int(t)for t in input().split()])\n \n ans = 0\n for _ in [0]*n:\n \tt = tuple([int(t)for t in input().split()])\n v = c\n\t\tfor i in range(m):\n v+=b[m]*t[m]\n if v>0:\n ans+=1\n print(ans)\nif __name__ == "__main__":\n main()', 'def main():\n n,m,c = tuple([int(t)for t in input().split()])\n b = tuple([int(t)for t in input().split()]) \n ans = 0\n for _ in [0]*n:\n t = tuple([int(t)for t in input().split()])\n v = c\n for i in range(m):\n v+=b[i]*t[i]\n if v>0:\n ans+=1\n print(ans)\nif __name__ == "__main__":\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s543142785', 's441605253'] | [3188.0, 3060.0] | [18.0, 18.0] | [342, 337] |
p03102 | u712082626 | 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\nfrom operator import mul\nfrom functools import reduce\n\nN, M, C = [int(x) for x in input().split()]\nB = np.array([int(x) for x in input().split()])\n#A = np.array([[0]*M,N])\nA = np.empty((N,M))\n\nresult = np.array([])\ncount = 0\n\nfor n in range(N):\n A[n] = [int(m) for m in input().split()]\n result = A[n-1] * B\n #print(result)\n if sum(result)+C > 0:\n count +=1\nprint(count)\n', 'import numpy as np\n\nN, M, C = [int(x) for x in input().split()]\nB = np.array([int(x) for x in input().split()])\nA = np.empty((N,M))\n\ncount = 0\nfor n in range(N):\n A[n] = [int(m) for m in input().split()]\n count += (sum(A[n] * B)+C > 0)\nprint(count)\n'] | ['Wrong Answer', 'Accepted'] | ['s780661028', 's966538521'] | [21960.0, 13500.0] | [364.0, 181.0] | [409, 255] |
p03102 | u720636500 | 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())\nBlis = [int(x) for x in input().split()]\nAlis = []\nk = 0\nfor i in range(N):\n Alis.append([int(x) for x in input().split()])\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[i][j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split)\nBlis = [int(x) for x in input().split()]\nk = 0\nfor i in range(N):\n Alis = [int(x) for x in input().split()]\n total = 0\n for j in range(M):\n total = total + (Alis[j])*(Blis[j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split())\nBlis = [int(x) for x in input().split()]\nAlis = []\nk = 0\nfor i in range(N):\n lis = [int(x) for x in input().split()]\n Alis[i] = lis\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[i][j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split())\nBlis = [int(x) for x in input().split()]\nAlis = []\nk = 0\nfor i in range(N):\n Alis[i] = [int(x) for x in input().split()]\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[i][j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split())\nBlis = [int(x) for x in input().split()]\nAlis = []*N\nk = 0\nfor i in range(N):\n Alis[i] = [int(x) for x in input().split()]\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k)', 'N, M, C = map(int, input().split())\nBlis = [int(x) for x in input().split()]\nAlis = []*N\nk = 0\nfor i in range(N):\n Alis[i] = [int(x) for x in input().split()]\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[i][j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k)', 'N, M, C = map(int, input().split())\nBlis = [int(x) for x in input().split()]\nAlis = []*M\nk = 0\nfor i in range(N):\n Alis[i] = [int(x) for x in input().split()]\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[i][j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split)\nBlis = [int(x) for x in input().split()]\nAlis = []\nk = 0\nfor i in range(N):\n Alis[i] = [int(x) for x in input().split()]\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[i][j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split)\nBlis = [int(x) for x in input().split()]\nk = 0\nfor i in range(N):\n Alis = [int(x) for x in input().split()]\n total = 0\n for j in range(M):\n total = total + Alis[j]*Blis[j]\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split)\nBlis = [int(x) for x in input().split()]\nk = 0\nfor i in range(N):\n Alis = [int(x) for x in input().split()]\n total = o\n for j in range(M):\n total = total + Alis[j]*Blis[j]\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split())\nBlis = [int(x) for x in input().split()]\nAlis = []*N\nk = 0\nfor i in range(N):\n Alis[i] = [int(x) for x in input().split()]\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[i][j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split())\nBlis = [int(x) for x in input().split()]\nAlis = [x for x in range(N)]\nk = 0\nfor i in range(N):\n Alis[i] = [int(x) for x in input().split()]\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[i][j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k) ', 'N, M, C = map(int, input().split())\nBlis = [int(x) for x in input().split()]\nAlis = []\nk = 0\nfor i in range(N):\n Alis.append([int(x) for x in input().split()])\nfor i in range(N):\n total = 0\n for j in range(M):\n total = total + (Alis[i][j])*(Blis[j])\n total = total + C\n if total > 0:\n k = k + 1\nprint(k)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s007396153', 's294598068', 's372678919', 's373239291', 's402428780', 's470019322', 's595142850', 's603242015', 's665367831', 's877481031', 's918415261', 's996347307', 's001727381'] | [3064.0, 3188.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3060.0, 3060.0, 3064.0, 3064.0, 3064.0] | [19.0, 20.0, 18.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 18.0, 18.0, 19.0, 18.0] | [320, 278, 329, 318, 313, 316, 319, 316, 274, 274, 319, 336, 314] |
p03102 | u729119068 | 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()))\ncount=0\nfor i in range(N):\n A=list(map(int, input().split()))\n p=C\n for j in range(M):\n P+=A[j]*B[j]\n if p>0:\n count+=1\nprint(count)', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\ncount=0\nfor i in range(N):\n A=list(map(int, input().split()))\n p=C\n for j in range(M):\n p+=A[j]*B[j]\n if p>0:\n count+=1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s893494756', 's329244450'] | [9200.0, 9204.0] | [23.0, 29.0] | [210, 206] |
p03102 | u739360929 | 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 solve():\n n, m, c = map(int, input().split())\n b = list(map(int, input().split()))\n a = [list(map(int, input().split())) for _ in range(n)]\n s = 0\n ans = 0\n for i in range(n):\n for j in range(m):\n s += a[i][j] * b[j]\n s += c\n print(s)\n if s > 0:\n ans += 1\n print(ans)\n\n\nif __name__ == '__main__':\n solve()\n", "def solve():\n n, m, c = map(int, input().split())\n b = list(map(int, input().split()))\n a = [list(map(int, input().split())) for _ in range(n)]\n s = 0\n ans = 0\n for i in range(n):\n s = 0\n for j in range(m):\n s += a[i][j] * b[j]\n if s + c > 0:\n ans += 1\n print(ans)\n\n\nif __name__ == '__main__':\n solve()\n"] | ['Wrong Answer', 'Accepted'] | ['s791900916', 's088986471'] | [3188.0, 3064.0] | [18.0, 17.0] | [384, 370] |
p03102 | u743164083 | 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 = list(map(int, input().split()))\nK, A = [0] * N, [0] * N\nfor i in range(N):\n K[i], *A[i] = list(map(int, input().split()))\nk = set(i for i in range(1, M + 1))\nki = k.intersection(*A)\nprint(len(ki))', 'N, M, C = list(map(int, input().split()))\nB = list(map(int, input().split()))\nA = []\nans, cnt = 0, 0\nfor i in range(N):\n A.append(list(map(int, input().split())))\nfor v in A:\n for i, w in enumerate(v):\n ans += w * B[i]\n if ans + C > 0:\n cnt += 1\n ans = 0\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s446950696', 's450341950'] | [3064.0, 3064.0] | [18.0, 17.0] | [206, 291] |
p03102 | u746154235 | 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())))\ncnt=0\n\nfor i in range(N):\n A=list(map(int, input().split()))\n p=C\n for j in range(M):\n p+=A[j]*B[J]\n if p>0:\n cnt+=1\nprint(cnt)\n', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\ncount=0\nfor i in range(N):\n A=list(map(int,input().split()))\n p=C\n for j in range(M):p+=A[j]*B[j]\n if p>0:count+=1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s551783882', 's069490529'] | [3060.0, 3060.0] | [18.0, 17.0] | [208, 203] |
p03102 | u748311048 | 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=[list(map(int, input().split())) for n in range(N)]\n\ndef Sof(a):\n d=C\n for m in range(M):\n d+=a[m]*b[m]\n return d > 0\n\nco=0\nfor i in range(N):\n if(Sof(A[i])):\n co+=1\n\nprint(co)', 'N,M,C=map(int, input().split())\nB=list(map(int, input().split()))\nA=[list(map(int, input().split())) for n in range(N)]\n\ndef Sof(a):\n d=C\n for m in range(M):\n d+=a[m]*B[m]\n return d > 0\n\nco=0\nfor i in range(N):\n if(Sof(A[i])):\n co+=1\n\nprint(co)'] | ['Runtime Error', 'Accepted'] | ['s333433625', 's168895785'] | [3064.0, 3064.0] | [18.0, 17.0] | [254, 254] |
p03102 | u759076129 | 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 = [int(i) for i in input().split()]\nbs = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n a_list = [int(i) for i in input().split()]\n cond = sum(a+b for a, b in zip(a_list, bs)) + c\n if cond > 0:\n ans += 1', 'n, m, c = [int(i) for i in input().split()]\nbs = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n a_list = [int(i) for i in input().split()]\n cond = sum(a+b for a, b in zip(a_list, bs)) + c\n if cond > 0:\n ans += 1\nprint(ans)', 'n, m, c = [int(i) for i in input().split()]\nbs = [int(i) for i in input().split()]\nans = 0\nfor _ in range(n):\n a_list = [int(i) for i in input().split()]\n cond = sum(a*b for a, b in zip(a_list, bs)) + c\n if cond > 0:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s418443500', 's708330276', 's015208860'] | [9048.0, 9184.0, 9184.0] | [26.0, 29.0, 27.0] | [242, 253, 254] |
p03102 | u760391419 | 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 = [ list(map(int,input().split())) for _ in range(N) ]\n\nans = 0\nfor a,b in A,B:\n ans += 1 if sum([i*j for i,j in a,b])+C>0\n print(ans)', 'N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\nA = [ list(map(int,input().split())) for _ in range(N) ]\n \nans = 0\nfor a in A:\n s = 0\n for i in range(M):\n s += a[i] * B[i]\n ans += 1 if s+C > 0 else 0\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s163237097', 's463196504'] | [2940.0, 3060.0] | [17.0, 17.0] | [205, 236] |
p03102 | u763172774 | 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. | ['c = input().split()\nc = list(map(int, c))\nb = input().split()\nb = list(map(int, b))\nans = 0\na = [0] * (c[0] - 1)\nfor n in range(c[0] - 1):\n\ta[n] = input().split()\n\ta[n] = list(map(int, a[n]))\n\ttmp = 0\n\tfor m in range(c[1] -1):\n\t\ttmp += b[m] * a[n][m]\n\tif tmp > -c[2]:\n\t\tans += 1\nprint(ans)', 'c = int(input().split())\nb = int(input().split())\nans = 0\nfor n in range(c[0]):\n\ta[n] = int(input().split())\n\ttmp = 0\n\tfor m in range(c[1]):\n\t\ttmp += b[m] * a[n][m]\n\tif tmp > -c[2]:\n\t\tans += 1\nprint(ans)', 'c = input().split()\nb = input().split()\nans = 0\nfor n in range(c[0]):\n\ta[n] = input().split()\n\ttmp = 0\n\tfor m in range(c[1]):\n\t\ttmp += b[m] * a[n][m]\n\tif tmp > -c[2]:\n\t\tans += 1\nprint(ans)', 'c = input().split()\nc = list(map(int, a))\nb = input().split()\nb = list(map(int, a))\nans = 0\nfor n in range(c[0]):\n\ta[n] = input().split()\n\ta[n] = list(map(int, a[n]))\n\ttmp = 0\n\tfor m in range(c[1]):\n\t\ttmp += b[m] * a[n][m]\n\tif tmp > -c[2]:\n\t\tans += 1\nprint(ans)', 'c = input().split()\nc = list(map(int, c))\nb = input().split()\nb = list(map(int, b))\nans = 0\na = [0] * (c[0])\nfor n in range(c[0]):\n\ta[n] = input().split()\n\ta[n] = list(map(int, a[n]))\n\ttmp = 0\n\tfor m in range(c[1]):\n\t\ttmp += b[m] * a[n][m]\n\tif tmp > -c[2]:\n\t\tans += 1\nprint(ans)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s119149317', 's502005673', 's655785181', 's913274857', 's271951374'] | [3064.0, 3060.0, 3060.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [289, 203, 188, 261, 278] |
p03102 | u777923818 | 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. | ['# -*- coding: utf-8 -*-\nimport numpy as np\nN, M, C = inpl()\nB = np.array(inpl(), dtype=np.int64)\nans = 0\nfor _ in range(N):\n A = np.array(inpl(), dtype=np.int64)\n ans += np.sum(A*B)+C > 0\nprint(ans)', '# -*- coding: utf-8 -*-\nimport numpy as np\ndef inpl(): return list(map(int, input().split()))\nN, M, C = inpl()\nB = np.array(inpl(), dtype=np.int64)\nans = 0\nfor _ in range(N):\n A = np.array(inpl(), dtype=np.int64)\n ans += np.sum(A*B)+C > 0\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s317954084', 's879589432'] | [27068.0, 27272.0] | [115.0, 122.0] | [204, 256] |
p03102 | u779293207 | 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()))\nnow = 0\nfor i in range(N):\n A=list(map(int,input().split()))\n ans = C\n for j in range(M):\n ans += A[j]*B[j]\n if (ans)>0:\n now += 1\nprint(now)\n', 'N,M,C= map(int,input().split())\nB= list(map(int,input().split()))\nnow = 0\nfor i in range(N):\n A=list(map(int,input().split()))\n ans = C\n for j in range(M):\n ans += A[j]*B[j]\n if (ans)>0:\n now += 1\nprint(now)\n'] | ['Runtime Error', 'Accepted'] | ['s758533641', 's631400069'] | [3064.0, 3060.0] | [18.0, 17.0] | [232, 234] |
p03102 | u779728630 | 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()))\nans = 0\nfor i in range(N):\n A = list(map(int, input().split()))\n tmp = 0\n for i,j in zip(B,A):\n tmp += i*j\n if tmp > C:\n ans += 1\nprint(ans)', '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 tmp = 0\n for i,j in zip(B,A):\n tmp += i*j\n if tmp + C > 0:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s253369473', 's962154904'] | [9124.0, 9176.0] | [34.0, 30.0] | [222, 227] |
p03102 | u780698286 | 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 = [list(map(int, input().split())) for i in range(n)]\nans = 0\nfor i in range(n):\n if sum(a[i]) + c > 0:\n ans += 1\nprint(ans)', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for i in range(n)]\nans = 0\nfor i in range(n):\n x = 0\n for j in range(m):\n x += a[i][j] * b[j]\n if x + c > 0:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s396014334', 's322485469'] | [9060.0, 9168.0] | [26.0, 29.0] | [202, 248] |
p03102 | u785066634 | 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_l=list(map(int,input().split()))\n\ncnt=0\nfor i in range(n):\n a_l_i = list(map(int,input().split()))\n c_l = 0\n for j in range(m-1):\n c_l += a_l_i[j] * b_l[j]\n last_ = c_l - c\n if last_>0:\n cnt+=1\nprint(cnt) \n \n\n\n', 'n,m,c=map(int,input().split())\nb_l=list(map(int,input().split()))\n\ncnt=0\nfor i in range(n):\n a_l_i = list(map(int,input().split()))\n c_l = 0\n for j in range(m):\n c_l += a_l_i[j] * b_l[j]\n last_ = c_l + c\n\n if last_>0:\n cnt+=1\nprint(cnt) \n \n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s564299904', 's720638885'] | [3060.0, 3060.0] | [18.0, 17.0] | [390, 389] |
p03102 | u790812284 | 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()))\n\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)', '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 tmp=0\n for i in range(m):\n print(a[i],b[i])\n tmp+=int(a[i])*int(b[i])\n \n if tmp+c>0:\n cnt+=1\n \nprint(cnt)', '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=int(a[i])*int(b[i])\n if tmp+c>0:\n cnt+=1\n tmp=0\nprint(cnt)', '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=int(a[i])*int(b[i])\n if tmp+c>0:\n cnt+=1\nprint(cnt)', '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)', '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 tmp=0\n for i in range(m):\n \n tmp+=int(a[i])*int(b[i])\n \n if tmp+c>0:\n cnt+=1\n \nprint(cnt)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s070497721', 's358241526', 's552389592', 's609395363', 's913307493', 's120523224'] | [3188.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0, 18.0, 18.0, 18.0] | [257, 288, 252, 238, 262, 271] |
p03102 | u798260206 | 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 = map(int,input().split())\nA = []\nans = 0\nfor i in range(m):\n a = map(int,input().split())\n A.append(a)\n\nsum = c\nfor i in range(n):\n for j in range(m):\n sum += A[i][j]*B[j]\n if sum > 0:\n ans += 1\n sum = c\nprint(ans)', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\ns = 0\nfor i in range(n):\n a = list(map(int, input().split()))\n t = 0\n for j in range(m):\n t += a[j]*b[j]\n if t+c > 0:\n s += 1\nprint(s)'] | ['Runtime Error', 'Accepted'] | ['s954945121', 's775780011'] | [3064.0, 3060.0] | [17.0, 18.0] | [279, 233] |
p03102 | u798316285 | 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(input().split())\nright_answer=0\nfor i in range(N):\n A=list(input().split())\n if sum(a*b for a,b in zip(A,B))+C>0:\n right_answer+=1\nprint(right_answer)', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nright_answer=0\nfor i in range(N):\n A=list(map(int,input().split()))\n if sum(a*b for a,b in zip(A,B))+C>0:\n right_answer+=1\nprint(right_answer)'] | ['Runtime Error', 'Accepted'] | ['s048257021', 's690358718'] | [3060.0, 3060.0] | [17.0, 17.0] | [193, 211] |
p03102 | u807028974 | 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 = input().split()\nAnm = []\nfor i in range(N):\n Anm.append(input().split())\ncont = 0\nfor A in Anm:\n c = 0\n for i in range(M):\n c += int(A[i]) * int(B[i])\n if c > 0:\n cont += 1\nprint(cont)', 'N,M,C = map(int,input().split())\nB = input().split()\nAnm = []\nfor i in range(N):\n Anm.append(input().split())\ncont = 0\nfor A in Anm:\n c = C\n for i in range(M):\n c += int(A[i]) * int(B[i])\n if c > 0:\n cont += 1\nprint(cont)'] | ['Wrong Answer', 'Accepted'] | ['s045672234', 's005763760'] | [3064.0, 3064.0] | [17.0, 18.0] | [247, 247] |
p03102 | u807889603 | 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 = []\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\nprint(arrB)\nprint(arrA)\nprint(D)\nprint(E)\nprint(F)\nprint(t)\n', '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'] | ['Wrong Answer', 'Accepted'] | ['s352362198', 's755125535'] | [12504.0, 12512.0] | [155.0, 148.0] | [708, 713] |
p03102 | u808427016 | 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 = [int(_) for _ in input().split()]\nB = [int(_) for _ in input().split()]\nA = [[int(_) for _ in input().split()] for i in range(N)]\n\nresult = len(\n row\n for row in A\n if C + sum([x * y for x, y in zip(row, B)]) > 0\n)\n\nprint(result)', 'N, M, C = [int(_) for _ in input().split()]\nB = [int(_) for _ in input().split()]\nA = [[int(_) for _ in input().split()] for i in range(N)]\n\nresult = sum(\n C + sum([x * y for x, y in zip(a, B)]) > 0\n for a in A\n)\n\nprint(result)'] | ['Runtime Error', 'Accepted'] | ['s269851290', 's344273028'] | [3060.0, 3064.0] | [18.0, 18.0] | [248, 233] |
p03102 | u809816772 | 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()))\nsource = []\npre = 0\nscore = 0\nfor i in range(n):\n source.append([int(x) for x in input().split()])\n\nfor j in range(0,n-1):\n for k in range(0,m-1):\n pre += source[j][k]*B[k]\n else:\n if pre + C > 0:\n score += 1\n pre = 0\nprint(score)\n\n', 'n, m, C = map(int, input().split())\nB = list(map(int, input().split()))\nsource = []\nscore = 0\nfor i in range(n):\n source.append([int(x) for x in input().split()])\n\nfor j in range(0,n-1):\n pre = 0\n for k in range(0,m-1):\n pre += source[j][k]*B[k]\n else:\n if pre + C > 0:\n score += 1\nprint(score)', 'n, m, C = map(int, input().split())\nB = list(map(int, input().split()))\nsource = []\npre = 0\nscore = 0\nfor i in range(n):\n source.append([int(x) for x in input().split()])\n\nfor j in range(0,n-1):\n for k in range(0,m-1):\n pre += source[j][k]*B[k]\n else:\n if pre + C > 0:\n score += 1\n pre = 0\nprint(score)\n\n', 'n, m, C = map(int, input().split())\nB = list(map(int, input().split()))\nsource = []\nscore = 0\nfor i in range(n):\n source.append([int(x) for x in input().split()])\n\nfor j in range(n):\n pre = 0\n for k in range(m):\n pre += source[j][k]*B[k]\n else:\n if pre + C > 0:\n score += 1\nprint(score)\n\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s243542264', 's259923464', 's662366507', 's443458514'] | [3064.0, 3064.0, 3064.0, 3060.0] | [18.0, 17.0, 17.0, 17.0] | [346, 332, 346, 326] |
p03102 | u813098295 | 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() ]\nA = []\nfor i in range(N):\n A += [ [ int(x) for x in input().split() ] ]\n\ncnt = 0\n\nfor i in A:\n print (i)\n tmp = 0\n for j, b in zip(i, B):\n tmp += j*b\n tmp += C\n if tmp > 0:\n cnt += 1\n\nprint (cnt)\n', 'N, M, C = map(int, input().split())\nB = [int(x) for x in input().split() ]\nA = []\nfor i in range(N):\n A += [ [ int(x) for x in input().split() ] ]\n\ncnt = 0\n\nfor i in A:\n tmp = 0\n for j, b in zip(i, B):\n tmp += j*b\n tmp += C\n if tmp > 0:\n cnt += 1\n\nprint (cnt)\n'] | ['Wrong Answer', 'Accepted'] | ['s301618633', 's596339862'] | [3064.0, 3060.0] | [19.0, 18.0] | [303, 289] |
p03102 | u813102292 | 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(i) for i in input().split())]\na = []\nfor i in range(N):\n a.append([int(i) for i in input().split()])\n\ncount = 0\nfor i in range(N):\n tmp = 0\n for j in range(M):\n tmp += b[j] * a[i][j]\n if tmp + C > 0:\n count += 1\n\nprint(count)', 'N, M, C = map(int, input().split())\nb = [map(int, input().split())]\na = []\nfor i in range(N):\n a.append([int(i) for i in input().split()])\n\ncount = 0\nfor i in range(N):\n tmp = 0\n for j in range(M):\n tmp += b[j] * a[i][j]\n if tmp + C > 0:\n count += 1\n\nprint(count)', 'N, M, C = map(int, input().split())\nb = [int(i) for i in input().split()]\na = []\nfor i in range(N):\n a.append([int(i) for i in input().split()])\n\ncount = 0\nfor i in range(N):\n tmp = 0\n for j in range(M):\n tmp += b[j] * a[i][j]\n if tmp + C > 0:\n count += 1\n\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s552769585', 's749388844', 's493933110'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [297, 289, 295] |
p03102 | u813371068 | 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()))\nB=np.array(b)\ncount=0\nfor i in range(n):\n A=np.array(list(map(int,input().split())))\n S=np.dot(B,A) + c\n if(S>0):\n count+=1\nprint(count)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\ncount=0\nfor i in range(N):\n A = list(map(int, input().split()))\n SUM=0\n for j in range(M):\n SUM += A[j]*B[j]\n if SUM+C > 0:count += 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s617391147', 's020911868'] | [3060.0, 3060.0] | [17.0, 17.0] | [216, 237] |
p03102 | u817692975 | 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. | ['s = list(map(int, input().split()))\nN = i[0]\nM = i[1]\nC = i[2]\nB = list(map(int, input().split()))\nx = 0\nfor i in range(N):\n k = C\n A = list(map(int, input().split()))\n for j in range(M):\n k = k + A[j] * B[j]\n if k > 0:\n x = x + 1\n else:\n pass\nprint(x) ', 's = list(map(int, input().split()))\nN = s[0]\nM = s[1]\nC = s[2]\nB = list(map(int, input().split()))\nx = 0\nfor i in range(N):\n k = C\n A = list(map(int, input().split()))\n for j in range(M):\n k = k + A[j] * B[j]\n if k > 0:\n x = x + 1\n else:\n pass\nprint(x) \n'] | ['Runtime Error', 'Accepted'] | ['s106794190', 's448794150'] | [3064.0, 3064.0] | [18.0, 18.0] | [268, 269] |
p03102 | u818218162 | 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())\nBli = list(map(int,input().split()))\nAli = [list(map(int, input().split())) for _ in range(N)]\n\nans = 0\n\nfor A in Ali:\n sumNum = 0\n for num, a in enumerate(A):\n sumNum += a * Bli[num]\n \n print(sumNum)\n if sumNum + C > 0:\n ans += 1\n\nprint(ans)\n', 'N, M, C = map(int, input().split())\nBli = list(map(int,input().split()))\nAli = [list(map(int, input().split())) for _ in range(N)]\n\nans = 0\n\nfor A in Ali:\n sumNum = 0\n for num, a in enumerate(A):\n sumNum += a * Bli[num]\n \n if sumNum + C > 0:\n ans += 1\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s161308325', 's092758168'] | [3060.0, 3060.0] | [17.0, 18.0] | [312, 294] |
p03102 | u820052258 | 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())\na = [list(map(int,input().split())) for i in range(m)]\nc=0\nfor i in range(n):\n x=0 \n for j in range(m):\n x=a[i+1][j]*a[0][j]\n if x+c>0:\n c+=1\nprint(c)', 'n,m,c=map(int,input().split())\na=[]\nfor i in range(n+1): \n a.append(list(map(int,input().split())) )\ny=0\nfor i in range(n):\n x=0 \n for j in range(m):\n x+=a[i+1][j]*a[0][j]\n if x+c>0:\n y+=1\nprint(y)'] | ['Runtime Error', 'Accepted'] | ['s384260890', 's445171356'] | [3060.0, 3060.0] | [18.0, 17.0] | [191, 209] |
p03102 | u821775079 | 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 i in range(N):\n A.append([int(i) in i for input().split()])\nans=0\nfor a in A:\n asum=0\n for i in range(M):\n asum+=A[i]+B[i]\n asum+=C\n if asum > 0:\n ans+=1\nprint(ans)', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nA=[]\nfor i in range(N):\n A.append([int(i) for i in input().split()])\nans=0\nfor a in A:\n asum=0\n for i in range(M):\n asum += a[i]*B[i]\n asum+=C\n if asum > 0:\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s349042496', 's370148781'] | [2940.0, 3064.0] | [17.0, 18.0] | [248, 250] |
p03102 | u827306875 | 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())\na = []\nfor i in range(N+1):\n a.append(list(map(int, input().split())))\nall = np.array(a)\nsum = 0\nnum = 0\n\nfor i in range(N):\n mul = np.sum(all[0] * all[i+1]) + C\n if mul > 0:\n num += 1\n mul = 0\n\nprint(num)', 'import numpy as np\nN, M ,C = map(int, input().split())\na = []\nfor i in range(N+1):\n a.append(list(map(int, input().split())))\nall = np.array(a)\nsum = 0\nnum = 0\n\nfor i in range(N):\n mul = np.sum(all[0] * all[i+1]) + C\n if mul > 0:\n num += 1\n mul = 0\n\nprint(num)'] | ['Runtime Error', 'Accepted'] | ['s855096292', 's235436105'] | [2940.0, 12484.0] | [18.0, 150.0] | [280, 279] |
p03102 | u830881690 | 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=list(map(int,input ().split()))\nnum=0\nfor i in range(n):\n a=list(map(int,input().split()))\n hoge=np.dot(b*a)+c\n if hoge>0:\n num+=1\nprint(num)', 'n,m,c=map(int,input().split())\nb=list(map(int,input ().split()))\nnum=0\nfor _ in range(n):\n a=list(map(int,input().split()))\n hoge=0\n for i in range(m):\n hoge+=a[i]*b[i]\n if hoge+c>0:\n num+=1\nprint(num)'] | ['Runtime Error', 'Accepted'] | ['s878704549', 's852895338'] | [26976.0, 9160.0] | [116.0, 26.0] | [199, 211] |
p03102 | u831274245 | 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. | ['H,W = [int(i) for i in input().split()]\n\nh1 = H//2\nh2 = H-h1\n\nw2 = W//2\nw1 = W-w2\n\nif H==1 or W==1:\n print(1)\nelse:\n print(h2*w1+h1*w2)', 'N,M,C = [int(i) for i in input().split()]\n\nB = [int(i) for i in input().split()]\nA = [[int(i) for i in input().split()] for i in range(N)]\n\nrez = [0]*N\n\nfor i in range(M):\n for j in range(N):\n rez[j] += B[i]*A[j][i]\n\ncount = 0\nfor i in rez:\n if i+C>0:\n count+=1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s712494865', 's464886765'] | [2940.0, 3064.0] | [17.0, 17.0] | [137, 282] |
p03102 | u842054747 | 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. | ['base_data = list(map(int,input().split()))\nline = base_data[0]\nnum = base_data[1]\nlast_num = base_data[2]\n\nelements = 0\nresult = 0\n\nmulti_data = list(map(int,input().split()))\n\nfor i in range(line):\n data = list(map(int,input().split()))\n while num > 0:\n elements += data[num-1] * multi_data[num-1]\n num -= 1\n if elements + last_num > 0:\n result += 1\n\nprint(result)', 'base_data = list(map(int,input().split()))\nline = base_data[0]\nlast_num = base_data[2]\n\nelements = 0\nresult = 0\n\nmulti_data = list(map(int,input().split()))\n\nfor i in range(line):\n elements = 0\n num = base_data[1]\n data = list(map(int,input().split()))\n \n while num > 0:\n elements += data[num-1] * multi_data[num-1]\n num -= 1\n\n if elements + last_num > 0:\n result += 1\n \nprint(result)'] | ['Wrong Answer', 'Accepted'] | ['s041851791', 's485006547'] | [3064.0, 3064.0] | [17.0, 18.0] | [377, 402] |
p03102 | u843318346 | 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()))\nans = 0\nfor i in range(n):\n a = list(map(int,input().split()))\n count = 0\n for j in range(m):\n count += b[j]*a[j]\n count += c\n if count > 0:\n ans += 0\nprint(ans)', '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 count = 0\n for j in range(m):\n count += b[j]*a[j]\n count += c\n if count > 0:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s921266943', 's006192939'] | [3060.0, 3060.0] | [18.0, 17.0] | [240, 241] |
p03102 | u844789719 | 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 = [int(_) for _ in input().split()]\nB = [int(_) for _ in input().split()]\nA = [[int(_) for _ in input().split()] for _ in range(N)]\nans = 0\nfor i in range(N):\n correct = True\n for j in range(M):\n if B[j] != A[i][j]:\n correct = False\n break\n if correct:\n ans += 1\nprint(ans)\n', 'N, M, C = [int(_) for _ in input().split()]\nB = [int(_) for _ in input().split()]\nA = [[int(_) for _ in input().split()] for _ in range(N)]\nans = 0\nfor i in range(N):\n score = 0\n for j in range(M):\n score += A[i][j] * B[j]\n if score + C > 0:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s347030608', 's034388304'] | [3060.0, 3060.0] | [17.0, 20.0] | [327, 286] |
p03102 | u845937249 | 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. | ["\nimport sys\nif sys.platform =='ios':\n sys.stdin=open('input_file.txt')\n\n\nn,m,c = map(int,input().split())\n\na = list(map(int,input().split()))\n\nb = [list(map(int,input().split())) for i in range(n)]\n\n\nprint(n,m,c)\nprint(a)\nprint(b)\n\ntest = 0\nans = 0\n\nfor i in range(n):\n\tfor j in range(m):\n\t\t#print(a[j])\n\t\t#print(b[i][j])\n\t\ttest = test + a[j]*b[i][j]\n\t#print(test+c)\n\tif test+c > 0:\n\t\tans = ans + 1\n\ttest = 0\n\nprint(ans)\n\t\t\n\n", "\nimport sys\nif sys.platform =='ios':\n sys.stdin=open('input_file.txt')\n\n\nn,m,c = map(int,input().split())\n\na = list(map(int,input().split()))\n\nb = [list(map(int,input().split())) for i in range(n)]\n\n\n#print(n,m,c)\n#print(a)\n#print(b)\n\ntest = 0\nans = 0\n\nfor i in range(n):\n\tfor j in range(m):\n\t\t#print(a[j])\n\t\t#print(b[i][j])\n\t\ttest = test + a[j]*b[i][j]\n\t#print(test+c)\n\tif test+c > 0:\n\t\tans = ans + 1\n\ttest = 0\n\nprint(ans)\n\t\t\n\n"] | ['Wrong Answer', 'Accepted'] | ['s516651789', 's741694566'] | [3064.0, 3064.0] | [18.0, 18.0] | [468, 471] |
p03102 | u846870091 | 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()))\n\nfor j in range(N):\n A= list(map(int, input().split()))\n i=0\n sum=0\n cnt=0\n for i in range(M):\n sum = sum + B[i]*A[i]\n if sum >= 0:\n cnt = cnt+1', 'N, M, C = map(int, input().split())\nB= list(map(int, input().split()))\ncnt = 0\nfor j in range(N):\n A= list(map(int, input().split()))\n i=0\n sum=0\n for i in range(M):\n sum = sum + B[i]*A[i]\n sum = sum + C\n if sum > 0:\n cnt += 1\n\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s717630051', 's386149447'] | [3064.0, 3064.0] | [18.0, 17.0] | [227, 270] |
p03102 | u847165882 | 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=[int(s) for s in input().split(" ")]\nB=[int(s) for s in input().split(" ")]\nA=[input().split(" ") for _ in range(N)]\n\ncount=0\nfor i in range(N):\n sum=0\n for j in range(M):\n sum+=int(A[i][j])*B[j]\n sum+=C\n print(sum)\n if sum>0:\n count=count+1\n \n\nprint(count)', 'N,M,C=[int(s) for s in input().split(" ")]\nB=[int(s) for s in input().split(" ")]\nA=[input().split(" ") for _ in range(N)]\n\ncount=0\nfor i in range(N):\n sum=0\n for j in range(M):\n sum+=int(A[i][j])*B[j]\n sum+=C\n if sum>0:\n count=count+1\n \n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s835617340', 's956391276'] | [3064.0, 3064.0] | [17.0, 17.0] | [274, 261] |
p03102 | u849324100 | 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 math\n#import numpy as np\n'''a,b= map(int,input().split())'''\n#a, b, c = [list(map(int, input().split())) for _ in range(3)]\n#li0= [int(x) for x in input().split()]\n#n,l= map(int, input().split())\n#x = [list(map(int, input().split())) for _ in range(n)] \na,b,c=map(int,input().split())\nli=[list(map(int,input().split())) for _ in range(a)]\nans=ju=0\n\nfor i in range(1,a):\n ans=0\n for j in range(b):\n ans+=li[0][j]*li[i][j]\n ans+=c\n\n if ans>0:\n ju+=1\nprint(ju)\n\n", "#import sys\n#import math\n#import numpy as np\n'''a,b= map(int,input().split())'''\n#a, b, c = [list(map(int, input().split())) for _ in range(3)]\n#li0= [int(x) for x in input().split()]\n#n,l= map(int, input().split())\n#x = [list(map(int, input().split())) for _ in range(n)] \na,b,c=map(int,input().split())\nli=[list(map(int,input().split())) for _ in range(a+1)]\nans=ju=0\nfor i in range(1,a+1):\n ans=0\n for j in range(b):\n ans+=li[0][j]*li[i][j]\n ans+=c\n if ans>0:\n ju+=1\nprint(ju)\n\n"] | ['Wrong Answer', 'Accepted'] | ['s909130469', 's572857415'] | [3060.0, 3060.0] | [18.0, 18.0] | [489, 491] |
p03102 | u852798899 | 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 = [list(map(int, input().split())) for i in range(n)]\n\nans = 0\nfor i in range(n):\n s = sum([a[i][j]*b[j] for j in range(m)])\n if s+c > 0:\n print(i)\n ans += 1\nprint(ans)', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for i in range(n)]\n\nans = 0\nfor i in range(n):\n s = sum([a[i][j]*b[j] for j in range(m)])\n if s+c > 0:\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s206870174', 's341125768'] | [3064.0, 3060.0] | [17.0, 17.0] | [250, 237] |
p03102 | u854685063 | 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\nimport math\ndef i():return int(sys.stdin.readline().replace("\\n",""))\ndef i2():return map(int,sys.stdin.readline().replace("\\n","").split())\ndef s():return str(sys.stdin.readline().replace("\\n",""))\ndef l():return list(sys.stdin.readline().replace("\\n",""))\ndef intl():return [int(k) for k in sys.stdin.readline().replace("\\n","").split()]\ndef lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\\n","").split()))\ndef t():return tuple(map(int,sys.stdin.readline().replace("\\n","").split()))\n\nif __name__ == "__main__":pass\nn,m,c = i2()\nb = intl()\ncnt = 0\ns = 0\nfor i in range(n):\n a = intl()\n for i in range(m):\n s += a[i]*b[i]\n print(s)\n if s+c > 0:\n cnt += 1\n s = 0\nprint(cnt)', 'import sys\nimport math\ndef i():return int(sys.stdin.readline().replace("\\n",""))\ndef i2():return map(int,sys.stdin.readline().replace("\\n","").split())\ndef s():return str(sys.stdin.readline().replace("\\n",""))\ndef l():return list(sys.stdin.readline().replace("\\n",""))\ndef intl():return [int(k) for k in sys.stdin.readline().replace("\\n","").split()]\ndef lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\\n","").split()))\ndef t():return tuple(map(int,sys.stdin.readline().replace("\\n","").split()))\n\nif __name__ == "__main__":pass\nn,m,c = i2()\nb = intl()\ncnt = 0\ns = 0\nfor i in range(n):\n a = intl()\n for i in range(m):\n s += a[i]*b[i]\n if s+c > 0:\n cnt += 1\n s = 0\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s411414221', 's776863302'] | [3188.0, 3064.0] | [20.0, 18.0] | [740, 723] |
p03102 | u856234158 | 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. | ['tmp = input()\nN = int(input().split()[0])\nM = int(input().split()[1])\nC = int(input().split()[2])\nB = [int(b) for b in input().split()]\ncnt = 0\nfor i in range(N):\n A = [int(a) for a in input().split()]\n sum = 0\n for j in range(M):\n sum += B[j]*A[j]\n sum += C\n if C > 0:\n cnt += 1\nprint(cnt)', "tmp = input()\nN = int(input().split(' ')[0])\nM = int(input().split(' ')[1])\nC = int(input().split(' ')[2])\nB = [int(b) for b in input().split(' ')]\ncnt = 0\nfor i in range(N):\n A = [int(a) for a in input().split(' ')]\n sum = 0\n for j in range(M):\n sum += B[j]*A[j]\n sum += C\n if C > 0:\n cnt += 1\nprint(cnt)", "tmp = input()\nN = int(tmp.split(' ')[0])\nM = int(tmp.split(' ')[1])\nC = int(tmp.split(' ')[2])\nB = [int(b) for b in input().split(' ')]\ncnt = 0\nfor i in range(N):\n A = [int(a) for a in input().split(' ')]\n sum = 0\n for j in range(M):\n sum += B[j]*A[j]\n sum += C\n if C > 0:\n cnt += 1\nprint(cnt)", 'tmp = input()\nN = int(input().split()[0])\nM = int(input().split()[1])\nC = int(input().split()[2])\ntmp = input()\nB = [int(b) for b in tmp.split()]\ncnt = 0\nfor i in range(N):\n tmp = input()\n A = [int(a) for a in tmp.split()]\n sum = 0\n for j in range(M):\n sum += B[j]*A[j]\n sum += C\n if C > 0:\n cnt += 1\nprint(cnt)\n', "tmp = input()\nN = int(tmp.split(' ')[0])\nM = int(tmp.split(' ')[1])\nC = int(tmp.split(' ')[2])\nB = [int(b) for b in input().split(' ')]\ncnt = 0\nfor i in range(N):\n A = [int(a) for a in input().split(' ')]\n sum = C\n for j in range(M):\n sum += B[j]*A[j]\n if sum > 0:\n cnt += 1\nprint(cnt)"] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s016098493', 's197972379', 's204174236', 's718413826', 's070670910'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 17.0, 17.0] | [301, 316, 304, 324, 295] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.