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 | u068142202 | 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 c... | ['n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\ncode_list = [list(map(int, input().split())) for _ in range(n)]\nans = 0\nfor code in code_list:\n total = 0\n for i, j in zip(code, b):\n total += i * j\n if total > 0:\n ans += 1\nprint(ans)', 'n, m, c = map(int, input().split())\nb ... | ['Wrong Answer', 'Accepted'] | ['s972987614', 's290961754'] | [3060.0, 3060.0] | [18.0, 18.0] | [265, 272] |
p03102 | u069129582 | 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 c... | ['n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\ncount=0\nans=0\nfor i in range(n):\n a=list(map(int,input().split()))\n for j in range(m):\n ans+=a[j]*b[j]\n print(ans)\n if ans+c>0:\n count+=1\n \nprint(count)', 'n,m,c=map(int,input().split())\nb=list(map(in... | ['Wrong Answer', 'Accepted'] | ['s874808787', 's322395268'] | [3060.0, 3064.0] | [18.0, 18.0] | [257, 242] |
p03102 | u069699931 | 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 c... | ['N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nAi= [input().split() for l in range(N)]\ncount=0\ntot=0\nfor i in range(N):\n for j in range(M):\n tot+=Ai[i][j]*B[i]\n if tot+C>0:\n count+=1\nprint(count)', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s493361396', 's588284015', 's418657739'] | [9116.0, 8980.0, 9232.0] | [25.0, 28.0, 26.0] | [240, 245, 243] |
p03102 | u073549161 | 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 c... | ['n,m,c = int(map,input().split())\nb = int(map,input().split())\ncount = 0\nfor i in range(n):\n sum = 0\n a = int(map, input().split())\n for j in range(m):\n sum += a[j] * b[j]\n sum += c\n if sum > 0:\n count += 1\nprint(count)', 'n,m,c = map(int,input().split())\nb = map(int,input().sp... | ['Runtime Error', 'Accepted'] | ['s931785947', 's717739710'] | [3060.0, 3064.0] | [18.0, 18.0] | [247, 275] |
p03102 | u075401284 | 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 c... | ['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\n\nfor l in a:\n tmp = 0\n for i in range(m):\n tmp += b[i]*a[i]\n tmp += c\n if tmp > 0:\n cnt += 1\n\nprint(cnt)', 'n, m, c = map(int, input().split())... | ['Runtime Error', 'Accepted'] | ['s847339547', 's287080974'] | [9132.0, 9108.0] | [24.0, 27.0] | [266, 266] |
p03102 | u076764813 | 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 c... | ['n,m,c=map(int,input().split())\nb=list(map(int, input().split()))\na=[list(map(int,input().split())) for _ in range(n)]\n\ncnt=0\nfor i in range(n):\n cal=0\n for j in range(m):\n cal += a[i][j]*b[j]\n if cal>0:\n cnt+=1\n \n\nprint(cnt)\n', 'n,m,c=map(int,input().split())\nb=list(map(int, i... | ['Wrong Answer', 'Accepted'] | ['s393188955', 's583240575'] | [3060.0, 3060.0] | [18.0, 17.0] | [251, 251] |
p03102 | u076996519 | 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 c... | ['n, m, c = map(int, input().split())\nb = list(int(x) for x in input().split())\nans = 0\n\nfor j in range(n):\n a = list(int(x) for x in input().split())\n sum = 0\n for i in range(m):\n sum = 0\n sum += a[i]*b[i]\n if sum > -c:\n ans += 1\n\nprint(ans)', 'n, m, c = map(int, i... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s420493745', 's440250899', 's480640080', 's579454098', 's587908643', 's730787416', 's931234135'] | [3060.0, 3060.0, 3060.0, 3064.0, 3060.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 18.0] | [281, 217, 217, 228, 269, 247, 257] |
p03102 | u091051505 | 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 c... | ['n, m, c = [int(i) for i in input().split(" ")]\na_list = input()\ni = 0\n\nfor i in range(n):\n b_list = input()\n ans = c\n for j in range(m):\n ans += a_list[j] * b_list[j]\n if ans > 0:\n i ++\n\nprint(i)', 'n, m, c = [int(i) for i in input().split(" ")]\na_list = input().split(" ")\nia =... | ['Runtime Error', 'Accepted'] | ['s848867773', 's995065019'] | [2940.0, 3060.0] | [17.0, 18.0] | [221, 258] |
p03102 | u092620892 | 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 c... | ['N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nk=0\nfor i in range(N-1):\n s=0\n A=list(map(int,input().split()))\n for j in range(M-1):\n s+=A[j]*B[j]\n s+=C\n if s>0:\n k+=1\nprint(k)\n', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nk=0\nfor i in... | ['Wrong Answer', 'Accepted'] | ['s356686281', 's099231710'] | [3060.0, 3060.0] | [17.0, 18.0] | [223, 219] |
p03102 | u095756391 | 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 c... | ['N, M, C = map(int, input().split())\n \nB = list(map(int, input().split()))\n \nans = []\n \nsrc = []\n \nfor i in range(N):\n src.append(list(map(int, input().split())))\n \n for n in range(M):\n d = src[i][n]*B[n] + C\n if (d > 0):\n ans.append(1)\n \nprint(ans.count(1))', 'N, M, C = map(int, input().... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s081880874', 's451931597', 's496026379', 's654880283', 's679947548', 's703856503', 's876724299', 's892099277', 's552855649'] | [3060.0, 3064.0, 3060.0, 3064.0, 3064.0, 3064.0, 3064.0, 3060.0, 3064.0] | [17.0, 18.0, 17.0, 17.0, 20.0, 17.0, 17.0, 17.0, 17.0] | [271, 292, 263, 285, 286, 301, 294, 261, 274] |
p03102 | u102902647 | 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 c... | ['3 3 0\n100 -100 0\n0 100 100\n100 100 100\n-100 100 100', 'N, M, C = map(int, input().split())\nB_list = list(map(int, input().split()))\nA_lists = [list(map(int, input().split())) for _ in range(N)]\n\ncnt = 0\nfor A_list in A_lists:\n tmp = [a * b for a, b in zip(A_list, B_list)]\n tmp = sum(tmp) + C\n if ... | ['Runtime Error', 'Accepted'] | ['s816664953', 's536864372'] | [8928.0, 9168.0] | [25.0, 25.0] | [51, 287] |
p03102 | u103902792 | 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 c... | ['N,M,c = map(int,input().split())\nb = list(map(int,input().split()))\na = [list(map(int,list(input()))) for i in range(N)]\n\nimport numpy as np\nB = np.array(b).T\nA = np.array(a)\nC = np.ones([N,1])*c\nres = np.dot(A,B) + C\nprint(np.sum(res > 0))', 'N,M,c = map(int,input().split())\nb = list(map(int,input().split(... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s843964377', 's886882222', 's283828432'] | [3064.0, 12464.0, 12468.0] | [18.0, 150.0, 150.0] | [240, 242, 277] |
p03102 | u107091170 | 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 c... | ['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 = C\n for j in range(M):\n tmp += A[j]*B[j]\n if tmp > 0:\n ans += 1\nprint(ans)\n', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nans = 0\nfor i in r... | ['Runtime Error', 'Accepted'] | ['s887729361', 's902339632'] | [2940.0, 3060.0] | [17.0, 17.0] | [218, 218] |
p03102 | u112766430 | 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 c... | ['N,M,C = list(map(int,input().split()))\nb = input()\ncount = 0\nfor i in range(N):\n\ta = input()\n\ts = 0\n\tfor j in range(M)\n\t\ts += a[j]*b[j]\n\tif s>C:\n\t\tcount+=1\nprint(count)\n', 'N,M,C = list(map(int,input().split()))\nb = input()\ncount = 0\nfor i in range(N):\n\ta = input()\n\ts = 0\n\tfor j in range... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s526863474', 's702597275', 's192499155'] | [2940.0, 3060.0, 3064.0] | [17.0, 17.0, 18.0] | [170, 172, 218] |
p03102 | u122195031 | 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 c... | ['N,M,C = list(map(int,input().split()))\nB = list(map(int,input().split()))\nans = 0\nlst = []\nfor i in range(N):\n A = list(map(int,input().split()))\n lst.append(A[i]*B[i])\nfor i in lst:\n if i > 0:\n ans += 1\nprint(ans)', 'N,M,C = list(map(int,input().split()))\nB = list(map(int,input().split()))\nans ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s096942046', 's102304171', 's745567660'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0] | [224, 228, 289] |
p03102 | u125269142 | 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 c... | ['n, m, c = map(int, input().split())\nb_lists = list(map(int, input().split()))\na_lists = []\nfor _ in range(n):\n tmp = list(map(int, input().split()))\n a_lists.append(tmp)\n\ncond = c\nans = 0\nfor i in a_lists:\n for j in range(m):\n cond = c\n cond += i[j]*b_lists[j]\n if cond > 0:\n ... | ['Wrong Answer', 'Accepted'] | ['s744002162', 's861769204'] | [9184.0, 9200.0] | [30.0, 32.0] | [329, 316] |
p03102 | u125433590 | 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 c... | ['n,m,c = map(int,input().split())\ninput_b = map(int,input().split())\na_list=[input() for i in range(n)]\nfor i in range(n):\n answer = c\n count = 0\n aitems = map(int,a_list[i].split())\n for j in range(m):\n answer += input_b[m] * aitems[m]\n if answer > 0:\n count+=1\nprint count', 'n,m,c = map(int,inp... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s072581073', 's081272942', 's083303679', 's411982167', 's498369599', 's657738329', 's687016864', 's808152716', 's919910584', 's122670897'] | [3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 2940.0, 2940.0, 3064.0] | [17.0, 19.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [284, 285, 283, 279, 277, 285, 284, 301, 349, 295] |
p03102 | u127499732 | 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 c... | ['n,m,c = map(int,input().split())\nb = list(map(int,input().split()))\ncount = 0\nfor _ in range(n):\n a = list(map(int,input().split()))\n if sum(a*b) + c > 0\n \tcount += 1\nprint(count)', 'n,m,c = map(int,input().split())\nb = list(map(int,input().split()))\ncount = 0\nfor _ in range(n):\n a = list(map(int,in... | ['Runtime Error', 'Accepted'] | ['s893305946', 's714650552'] | [2940.0, 3060.0] | [17.0, 17.0] | [183, 215] |
p03102 | u128740947 | 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 c... | ['n, m, c = map(int,input().split())\nb = list (map(int,input().split()))\na = []\nfor i in range(n):\n A = list(map(int,input().split()))\n a.append(A)\nans = 0\nprint(a)\nfor i in range(n):\n z = a[i]\n Z = 0\n for l in range(len(z)):\n Z += z[l] * b[l]\n if Z + c > 0:\n ans += 1\nprin... | ['Wrong Answer', 'Accepted'] | ['s583621242', 's475627097'] | [3064.0, 3188.0] | [17.0, 19.0] | [309, 300] |
p03102 | u131264627 | 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 c... | ['n, m, c = map(int, input().split())\nb = [int(i) for i in input().split()]\na = [[int(input()) for _ in range(m)] for _ in range(n)]\nans = 0\nctn = 0\nfor j in range(n):\n for k in range(m):\n ctn += b[k] * a[j][k]\n if ctn + c > 0:\n ans += 1\n ctn = 0\nprint(ans)\n', 'n, m, c = map(int, inpu... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s069245551', 's992542500', 's769601444'] | [3064.0, 3064.0, 3060.0] | [18.0, 17.0, 18.0] | [279, 278, 276] |
p03102 | u153823221 | 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 c... | ['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\nl = []\n\nfor i in range(n):\n for j in range(m):\n l.append(a[i][j] * b[j]) \n if sum(l) + c > 0:\n ans += 1\n l.clear()\n else:\n l.clear()\n\nprint(... | ['Wrong Answer', 'Accepted'] | ['s108895557', 's093724940'] | [3064.0, 3064.0] | [17.0, 20.0] | [307, 303] |
p03102 | u154979004 | 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 c... | ['N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\ncnt = 0\nfor _ in range(N):\n A = list(map(int, input().split()))\n cnt += int(sum(A[i] * B[i] for i in range(M)) > 0)\nprint(cnt)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\ncnt = 0\nfor _ in range(N):\n A =... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s493369313', 's754505860', 's516151765'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [200, 204, 206] |
p03102 | u156302018 | 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 c... | ['nmc = input().split()\nlstb = input().split()\na = []\nfor n in range(int(nmc[0])):\n a.append(input().split())\ntotal = 0\ncount = 0\nfor n in range(int(nmc[0])):\n for m in range(int(nmc[1])):\n total += (int(lstb[m]) * int(a[n][m]))\n if total - int(nmc[2]) > 0:\n count += 1\n total = 0\n... | ['Wrong Answer', 'Accepted'] | ['s031123222', 's302747142'] | [3064.0, 3064.0] | [17.0, 17.0] | [317, 317] |
p03102 | u158126367 | 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 c... | ['N,M,C = map(int, input().split())\nB = list(map(int, input().split()))\nans=0\nfor i in range(N):\n A = list(map(int, input().split()))\n ssum = sum([A[i]*B[i] for i in range(M)])+C\n if ssum>=0:\n ans+=1\nprint(ans)', 'N,M,C = list(map(int,input().split()))\nb = list(map(int,input().split()))\ncount ... | ['Wrong Answer', 'Accepted'] | ['s281044756', 's546819341'] | [3060.0, 3060.0] | [18.0, 18.0] | [224, 219] |
p03102 | u165233868 | 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 c... | ['N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\n\ncount = 0\nfor i in range(N):\n lst = list(map(int, input().split()))\n lb = 0\n for l,b in zip(lst,B):\n lb + l * b\n if lb - C > 0:\n count += 1\n\nprint(count)', 'N, M, C = map(int, input().split())\nB = list(map(... | ['Wrong Answer', 'Accepted'] | ['s303121202', 's861901841'] | [3060.0, 3060.0] | [18.0, 18.0] | [252, 253] |
p03102 | u166621202 | 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 c... | ['import numpy as np\n\nN,M,C = map(int,input().split())\nB=np.array(list(map(int,input().split())))\nans=0\n\nfor i in range(N):\n A=np.array(list(map(int,input().split())))\n if sum(A-B)-C > 0:\n ans+=1\nprint(ans)\n', '#N,M,C=map(int,input().split())\n#B=[int,input() for _ in range(M)]\n#\n\n# A=[int,input() f... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s330412439', 's381321946', 's443837901'] | [12504.0, 2940.0, 3060.0] | [147.0, 17.0, 18.0] | [210, 330, 219] |
p03102 | u167273718 | 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 c... | ['N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\nans = 0\nA = []\nfor i in range(N):\n A.append(list(map(int,input().split())))\n for j in range(M):\n S = C\n S += A[i][j] * B[j]\n if S > 0:\n ans += 1\nprint(ans)', 'N,M,C = map(int,input().split())\nB = list(map(int... | ['Wrong Answer', 'Accepted'] | ['s838163486', 's020749581'] | [3060.0, 3064.0] | [18.0, 17.0] | [253, 276] |
p03102 | u178888901 | 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 c... | ["vdef judge(A, B, C, M):\n\tresult = C\n\tfor i in range(M):\n\t\tresult += A[i] * B[i]\n\n\treturn result > 0\n\ndef main():\n\tN, M, C = map(int, input().split())\n\tB = map(int, input().split())\n\tcount = 0\n\n\tfor i in N:\n\t\tA = map(int, input().split())\n\n\t\tif judge(A, B, C, M):\n\t\t\tcount += 1\n\n\tprin... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s218558556', 's383451506', 's471150745', 's505740713', 's859240125', 's113613868'] | [2940.0, 3064.0, 3064.0, 2940.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0, 18.0, 17.0, 18.0] | [329, 335, 328, 319, 329, 351] |
p03102 | u181195295 | 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 c... | ['N, M, K =map(int().input().aplit())\nbases = list(map(int,input()))\nans=0\n\nfor i in range(M):\n A = list(map(int,input().split()))\n tmp=0\n for j in range(3):\n tmp+= bases[j]*A[j]\n if tmp>0:\n ans+=1\n \nprint(ans)', 'N, M, K =map(int,input().aplit())\nbases = list(map(int,input()))\nans=0\n\nfor i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s081568662', 's456380410', 's942032179', 's535158273'] | [3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0, 17.0] | [221, 220, 228, 232] |
p03102 | u182004566 | 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 c... | ['def is_okay(A, B, C):\n sum = 0\n for i in range(len(B)):\n sum += A[i] * B[i]\n\n return sum > 0\n\nN, M, C = map(int, input().split())\nB = tuple(map(int, input().split()))\n\nanswer = 0\nfor _ in range(N):\n A = tuple(map(int, input().split()))\n answer += is_okay(A, B, C)\n\nprint(answer)\n'... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s175682793', 's849590128', 's431772988'] | [3060.0, 3060.0, 3060.0] | [18.0, 18.0, 17.0] | [301, 314, 318] |
p03102 | u189479417 | 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 c... | ['N, M, C = map(int,input().split())\nB = list(map(int,input().split()))\ncnt = 0\nfor _ in range(N):\n ans = 0\n A = list(map(int,input().split()))\n for i in range(M):\n ans += A[i] * B[i]\n if ans > C:\n cnt += 1\nprint(cnt)', 'N, M, C = map(int,input().split())\nB = list(map(int,in... | ['Wrong Answer', 'Accepted'] | ['s490213277', 's967926228'] | [3060.0, 3060.0] | [17.0, 18.0] | [249, 254] |
p03102 | u191423660 | 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 c... | ['N, M, C = map(int, input().split()) \n 2 B = list(map(int, input().split()))\n 3 \n 4 S = [[0]*M for i in range(N)]\n 5 for i in range(N):\n 6 S[i] = list(map(int, input().split()))\n 7 ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s421502401', 's710994491', 's996111233'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 19.0] | [503, 520, 435] |
p03102 | u202400119 | 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 c... | ['[[source]]\nname = "pypi"\nurl = "https://pypi.org/simple"\nverify_ssl = true\n\n[dev-packages]\n\n[packages]\npandas = "*"\nnumpy = "*"\n\n[requires]\npython_version = "3.7"\n', 'import numpy as np\n\nn, m, c = map(int, input().split())\nb = list(map(int, input().split()))\n\nb = np.array(b)\n\ncount = 0\nfor _ in r... | ['Runtime Error', 'Accepted'] | ['s694510241', 's726947120'] | [2940.0, 12420.0] | [17.0, 150.0] | [163, 270] |
p03102 | u204616996 | 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 c... | ['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 if sum([a*b for a in A for b in B])+C>0:\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().s... | ['Wrong Answer', 'Accepted'] | ['s378850408', 's909332733'] | [3060.0, 3060.0] | [18.0, 18.0] | [188, 186] |
p03102 | u208120643 | 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 c... | ['"""Boot-camp-for-Beginners_Easy005_B_Can-you-solve-this_25-August-2020.py"""\n\nN, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = list(list(map(int, input().split())) for i in range(N))\n\ncount=0\nfor i in range(N):\n s=0\n for j in range(len(B)):\n s+=B[j]*A[i][j]\n print... | ['Wrong Answer', 'Accepted'] | ['s975221868', 's008710908'] | [9208.0, 9136.0] | [26.0, 28.0] | [354, 341] |
p03102 | u220345792 | 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 c... | ['N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\ncnt = 0\nfor i in range(M):\n A = list(map(int, input().split()))\n tmp = 0\n for j in range(N):\n tmp += A[j]*B[j]\n tmp += C\n if tmp > 0:\n cnt += 1\n \nprint(cnt)\n ', 'N, M, C = map(int, input().split())\nB = li... | ['Runtime Error', 'Accepted'] | ['s660053124', 's542527012'] | [3064.0, 3060.0] | [18.0, 18.0] | [258, 260] |
p03102 | u221345507 | 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 c... | ['import numpy as np\n\nN, M, C = map(int,input().split())\n\nB = list(map(int,input().split()))\n\ncount = 0\nfor i in range (N):\n A = list(map(int,input().split()))\n if np.array(A)*np.array(B) > 0:\n count += 1\nprint(count)', 'import numpy as np\n \nN, M, C = map(int,input().split())\n \nB = list(map(... | ['Runtime Error', 'Accepted'] | ['s413301307', 's721785458'] | [12424.0, 13024.0] | [147.0, 179.0] | [228, 242] |
p03102 | u233183615 | 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 c... | ['n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\na=[list(map(int,input().split())) for _ in range(n)]\ncount=0\nfor i in range(n-1):\n for j in range(m-1):\n total+=b[j]*a[i][j]\n if total>-c:\n count+=1\nprint(count)', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split... | ['Runtime Error', 'Accepted'] | ['s981056276', 's209157678'] | [3060.0, 3060.0] | [17.0, 17.0] | [245, 253] |
p03102 | u241347678 | 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 c... | ['s=input().split()\nn=int(s[0]);m=int(s[1]);c=int(s[2])\nb=input().split();a=[];ans=0\nfor i in range n : a.append(input().split())\nfor i in range n :\n temp=0\n for j in range m : temp+=int(a[i][j])*int(b[j])\n if temp+c>0 : ans+=1\nprint(ans)', 's=input().split()\nn=int(s[0]);m=int(s[1]);c=int(s[2])\nb=input().s... | ['Runtime Error', 'Accepted'] | ['s329380333', 's694904617'] | [2940.0, 3064.0] | [17.0, 18.0] | [239, 242] |
p03102 | u243572357 | 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 c... | ['n, m, c = map(int, input().split())\nb = map(int, input().split())\ncount = 0\n\nfor i in range(n):\n a = map(int, input().split())\n for j in range(m):\n if 0 < a[m] * b[m] + c:\n count += 1\nprint(count)', 'n, m, c = map(int, input().split())\nb = map(int, input().split())\ncount = 0\n \nfor i in range(n)... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s262181140', 's266006795', 's482359054', 's551374706', 's573965523', 's607645861', 's762552060', 's591690676'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [206, 207, 229, 209, 209, 228, 219, 222] |
p03102 | u244416763 | 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 c... | ['n,m,c = map(int,input().split())\nans = 0\nfor i in range(m):\n current = 0\n a = list(map(int,input().split()))\n for k,j in enumerate(a):\n current += j*(k+1)\n ans += 1 if c+current else 0\nprint(ans)', 'n,m,c = map(int,input().split())\nb = list(map(int,input().split()))\nans = 0\nfor i in rang... | ['Runtime Error', 'Accepted'] | ['s898960306', 's735911647'] | [3060.0, 3060.0] | [17.0, 17.0] | [214, 208] |
p03102 | u249727132 | 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 c... | ['N, M, C = map(int, input().split())\nB = [int(input()) for i in range(M)]\nA = [[int(input()) for i in range(M)] for j in range(N)]\ncnt = 0\nfor i in range(N):\n ans = 0\n for j in range(M):\n ans += A[j][i] * B[j]\n if ans + C > 0:\n cnt += 1\nprint(cnt)\n', 'N, M, C = map(int, input().split(... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s538264445', 's922348184', 's459315572'] | [3060.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0] | [270, 270, 243] |
p03102 | u252828980 | 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 c... | ['n,m,c = map(int,input().split())\na = input().split()\na = [int(x) for x in a]\n\nd = 0\ne = 0\nfor i in range(n):\n b = input().split()\n b = [int(x) for x in b]\n for j in range(m):\n d += b[j]*a[j]\n print(d)\n if d + c >0:\n e += 1\n d = 0\nprint(e)', 'n,m,c = map(int,input().split... | ['Wrong Answer', 'Accepted'] | ['s331866520', 's024881670'] | [3064.0, 3060.0] | [18.0, 18.0] | [270, 237] |
p03102 | u252964975 | 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 c... | ['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 hyoka = 0\n for k in range(M):\n hyoka = hyoka + A[k]*B[k]\n if hyoka+C > 0:\n count = cocunt + 1\nprint(count)', 'N,M,C=map(int, input().split())\nB=list(map(int, input().... | ['Runtime Error', 'Accepted'] | ['s537885551', 's995394090'] | [3060.0, 3060.0] | [17.0, 17.0] | [247, 246] |
p03102 | u255499778 | 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 c... | ['n, m, c = list(map(int, input().split()))\nB = list(map(int, input().split()))\ncount = 0\nli = [list(map(int, input().split())) for i in range(n)]\n\nfor i in range(n):\n d = 0\n for j in range(m):\n d = li[i][j] * B[j]\n else:\n d += c\n if d > 0:\n count += 1\nprint(count)'... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s503657397', 's696521051', 's530323518'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [304, 306, 305] |
p03102 | u256833330 | 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 c... | ['import numpy as np\nn,m,c=map(int,input().split())\nb=np.array(list(map(int,input().split())))\nac=0\nfor _ in range(n):\n a=np.array(list(map(int,input().split())))\n print(a*b)\n if sum(a*b)+c >0:\n ac+=1\nprint(ac)\n', 'import numpy as np\nn,m,c=map(int,input().split())\nb=np.array(list(map(int,inp... | ['Wrong Answer', 'Accepted'] | ['s948062081', 's639325652'] | [18316.0, 12504.0] | [258.0, 148.0] | [225, 210] |
p03102 | u258436671 | 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 c... | ['N, M, C = map(int, input().split())\nB = [int(_) for _ in input().split()]\nfor i in range(1, N + 1):\n Ai = [int(_) for _ in input().split()]\n\nright = 0\n\nfor j in range(1,N + 1):\n src = 0\n for k in range(M):\n src += Aj[k] * B[k]\n if src + C > 0:\n right += 1\n\nprint(right)\n', 'N, M, C = map(int... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s495965899', 's853499010', 's888630146'] | [3060.0, 2940.0, 3064.0] | [19.0, 18.0, 19.0] | [282, 294, 288] |
p03102 | u262801165 | 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 c... | ['n, m, c = map(int, input().split())\na = []\nb = list(map(int, input().split()))\n\nfor i in range(n):\n a.append(list(map(int, input().split())))\n print(a)\n\ncount = 0\nfor i in range(n):\n x = 0\n for j in range(m):\n x += a[i][j] * b[j]\n x += c\n\n if x > 0:\n count += 1\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s151658977', 's379801883', 's197875008'] | [3060.0, 3064.0, 3060.0] | [18.0, 17.0, 20.0] | [320, 386, 307] |
p03102 | u263830634 | 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 c... | ["N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\ni = 0\ncount = 0\nwhile i < N:\n A = list(map(int, input().split()))\n# print ('A', A)\n j = 1\n ans = C\n while j <= M:\n ans += A[j-1] * B[j-1]\n j += 1\n# print (ans)\n if ans > 0:\n count += 1\n ... | ['Wrong Answer', 'Accepted'] | ['s637063321', 's000832053'] | [3064.0, 3188.0] | [18.0, 19.0] | [334, 325] |
p03102 | u273326224 | 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 c... | ['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\ncount = 0\nfor n in range(N):\n sum = C\n for m in range(M):\n sum += b[m]*a[n][m]\n if sum > 0:\n count += 1\nprint(count)', 'N, M, C = map(int, input().split())\nB = list(map... | ['Runtime Error', 'Accepted'] | ['s157403629', 's052945558'] | [3060.0, 3060.0] | [17.0, 17.0] | [254, 264] |
p03102 | u276115223 | 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 c... | ['# ABC 121: B – Can you solve this?\nn, m, c = [int(s) for s in input().split()]\nb = [int(s) for s in input().split()]\n\na = []\nfor _ in range(n):\n a.append([int(s) for s in input().split()])\n\ncounter = 0\n\nfor i in range(n):\n answer = c\n \n for j in range(m):\n answer += a[i][j] * b[j]\n\n... | ['Wrong Answer', 'Accepted'] | ['s262968051', 's761904867'] | [3064.0, 3064.0] | [19.0, 18.0] | [384, 340] |
p03102 | u290187182 | 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 c... | ["import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\nfrom decimal import *\n\n\ndef lcm(x, y):\n return (x * y) // math.gcd(x, y)\n\n\nif __name__ == '__main__':\n n,m,c = map(int, input().split... | ['Wrong Answer', 'Accepted'] | ['s956290917', 's953658991'] | [5144.0, 5136.0] | [35.0, 36.0] | [567, 564] |
p03102 | u295120316 | 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 c... | ['N, M, C = int(input())\nB = list(map(int, inpot().split()))\ncount = 0\nfor j in range(N)\n A = list(map(int, input().split()))\n\nfor i in range(M):\n calc = A[i] * B[i]\n if C + calc > 0\n count+=1\n\nprint(count) \n \n \n', 'N, M, C = int(input())\nB = list(map(int, inpot().split()))\nco... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s363319215', 's479193265', 's488131794', 's576443395', 's759790343', 's882485733'] | [3064.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 19.0, 18.0, 17.0] | [237, 238, 237, 236, 247, 263] |
p03102 | u298373736 | 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 c... | ['# S = input()\n\n\nn,m,c=map(int,input().split())\nb=list(map(int,input().split()))\ne = [[int(i) for i in input().split()] for i in range(n)]\n\ntotal=0\ncount=0\n\n\nfor j in range(0,n):\n\ttotal=0\n\tfor k in range(0,m):\n\t\ttotal+=e[j][k]*b[k]\n\t\tprint("total is ",total)\n\tif total+c>0:\n\t\tcount+=1\n\nprint... | ['Wrong Answer', 'Accepted'] | ['s469803767', 's257310021'] | [3188.0, 3060.0] | [18.0, 17.0] | [347, 320] |
p03102 | u302292660 | 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 c... | ['n,m,c = map(int,input().split())\nb = list(map(int,input().split()))\ncnt = 0\nfor i in range(n):\n a = list(map(int,input().split()))\n for j in range(m):\n sum = 0\n sum += (a[j]*b[j])\n sum += c\n if sum > 0:\n cnt += 1\n else:\n pass\nprint(cnt)', 'n,m,c = map(int,input().split())\nb = map(int,in... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s012223563', 's421426779', 's892190862', 's508465711'] | [3064.0, 3060.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 17.0] | [253, 237, 238, 251] |
p03102 | u305018585 | 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 c... | ["N, M, C = map(int,input().split(' '))\nimport numpy as np\nB = np.array(list(map(int,input().split(' '))))\ndef f(A, B, C):\n A = np.array(list(map(int,A.split(' '))))\n return np.sum(A*B) +C > 0\nprint(", "N, M, C = map(int,input().split(' '))\nimport numpy as np\nB = np.array(list(map(int,input().split(' '))... | ['Runtime Error', 'Accepted'] | ['s541964023', 's175138858'] | [2940.0, 12452.0] | [17.0, 149.0] | [204, 249] |
p03102 | u312748806 | 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 c... | ['import numpy as np\nn, m, c = list(map(int, input().split()))\nb = np.array(list(map(int, input().split())))\ncount = 0\nprint(b)\nfor i in range(n):\n a = np.array(list(map(int, input().split())))\n result = sum(a*b) + c\n print(result)\n if result > 0:\n count += 1\nprint(count)', 'import numpy a... | ['Wrong Answer', 'Accepted'] | ['s206497864', 's320009532'] | [20772.0, 14440.0] | [374.0, 150.0] | [289, 262] |
p03102 | u313403396 | 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 c... | ['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 if sum(A*B) + C > 0:\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().spl... | ['Runtime Error', 'Accepted'] | ['s649783609', 's883495017'] | [9128.0, 9116.0] | [26.0, 28.0] | [178, 226] |
p03102 | u316322317 | 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 c... | ['n,m,c=map(int,input().split())\nb=list(int,input())\na=[list(map(int,input().split())) for i in range(n)]\ncount=0\nfor i in range(n):\n sum=c\n for j in range(m):\n sum+=a[i,j]*b[j]\n if sum>0:\n sum+=1\nprint(sum)', 'n,m,c=map(int,input().split())\na=[list(map(int,input().split())) for i in range(n+1)]\nco... | ['Runtime Error', 'Accepted'] | ['s362441598', 's401067477'] | [3060.0, 3060.0] | [17.0, 17.0] | [214, 207] |
p03102 | u327668449 | 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 c... | ['NMC = list(map(lambda x: int(x), input().split()))\nN = NMC[0]\nM = NMC[1]\nC = NMC[2]\n\nB = list(map(lambda x: int(x), input().split()))\nA = [list(map(lambda x: int(x), input().split())) for i in range(N)]\n\nprint("B", B)\nprint("A", A)\nprint("N", N)\nprint("M", M)\nprint("C", C)\n\nanswer = 0\n\nfor i in range(... | ['Wrong Answer', 'Accepted'] | ['s701109246', 's296652014'] | [3064.0, 3064.0] | [18.0, 18.0] | [457, 361] |
p03102 | u331997680 | 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 c... | ['import numpy as np\nN, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = [ ]\nfor i in range(N):\n AA = list(map(int, input().split()))\n A.append(AA)\nBnp = np.array(B)\nAnp = np.array(A)\nC = np.dot(Anp, Bnp) + 10\nD = 0\nfor i in range(N):\n if C[i] > 0:\n D += 1\nprint(D)', 'import ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s144844689', 's806437973', 's146245472'] | [12508.0, 12508.0, 12508.0] | [152.0, 151.0, 155.0] | [293, 292, 292] |
p03102 | u333404917 | 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 c... | ['n, m, c = map(int, input().split())\nb = [int(x) for x in input().split()]\nans = 0\nfor _ in range(n):\n if sum([b[i] * int(x) for i, x in enumerate(input().split())]) > c:\n ans += 1\nprint(ans)', 'n, m, c = map(int, input().split())\nb = [int(x) for x in input().split()]\nans = 0\nfor _ in range(n):\n if su... | ['Wrong Answer', 'Accepted'] | ['s175609423', 's089091569'] | [3060.0, 3060.0] | [17.0, 17.0] | [194, 204] |
p03102 | u334535590 | 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 c... | ['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)]\nsum = 0\ncnt = 0\nfor i in range(n):\n sum = 0\n for j in range(m):\n sum = a[i][j] * b[j] + c\n if sum > 0:\n cnt += 1\nprint(cnt)', 'n, m, c = [int(_) for _ in inpu... | ['Wrong Answer', 'Accepted'] | ['s874959198', 's709624979'] | [3064.0, 3060.0] | [17.0, 18.0] | [272, 274] |
p03102 | u342051078 | 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 c... | ['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 num = 0\n for j in range(m):\n num += a[j]*b[j]\n num += C\n if num > 0:\n ans += 1\nprint(ans)', 'n,m,c = map(int,input().split())\nb = list(map(int,in... | ['Runtime Error', 'Accepted'] | ['s861553694', 's966891507'] | [3064.0, 3060.0] | [17.0, 18.0] | [250, 250] |
p03102 | u350093546 | 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 c... | ['n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\ncount=0\nx=0\nfor i in range(n):\n lst=list(map(int,input().split()))\n for j in range(m):\n x+=lst[j]*b[j]\n if x-c>0:\n count+=1\nprint(count)', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\nresult=0\nfor i in range(n):\... | ['Wrong Answer', 'Accepted'] | ['s918362286', 's262053726'] | [3060.0, 3060.0] | [17.0, 17.0] | [209, 214] |
p03102 | u357949405 | 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 c... | ['N, M, C = map(int, input().split())\nB = [int(i) for i in input().split()]\nans = 0\nfor _ in range(N):\n A = [B[i] * int(j) for i,j in enumerate(input().split())]\n ans += 1 if sum(A) > 0 else 0\nprint(ans)', 'N, M, C = map(int, input().split())\nB = [int(i) for i in input().split()]\nans = 0\nfor _ in range(N):\n... | ['Wrong Answer', 'Accepted'] | ['s302884641', 's197029266'] | [3060.0, 3060.0] | [17.0, 17.0] | [203, 207] |
p03102 | u363836311 | 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 c... | ['n,m,c=map(int, input().split())\nB=list(map(int, input().split()))\ng=0\nfor i in range(n):\n A=list(map(int, input().split()))\n for i in range(m):\n t=A[i]*B[i]\n if t+c>0:\n g+=1\nprint(g)', 'n,m,c=map(int, input().split())\nB=list(map(int, input().split()))\ng=0\nfor i in range(n):\n A=list(map(int,... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s614592194', 's717575461', 's326486966'] | [2940.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0] | [195, 198, 203] |
p03102 | u368016155 | 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 c... | ['N,M,C = map(int, input().split())\nB = [int(_) for _ in input().split()]\n\ncount = 0\nfor i in range(N):\n A = [int(_) for _ in input().split()] \n sum = 0\n for j in range(M):\n sum = B[j]*A[j]\n if sum-C > 0:\n count += 1\n\nprint(count)', 'N,M,C = map(int, input().split())\nB = [int(_) for _ in input().... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s149007036', 's358601885', 's553750152', 's883056442', 's729003621'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [238, 238, 243, 239, 239] |
p03102 | u368796742 | 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 c... | ['n,m,c = map(int,input().split())\nb = list(map(int,input().split()))\ncount = 0\nans = 0\nfor i in range(n):\n l = list(map(int,input().split()))\n for j in range(m):\n ans += b[j]*a[j]\n if ans +c > 0:\n count += 1\n \n ans = 0\nprint(count)\n', 'n,m,c = map(int,input().split())\nb = list(map(int,input(... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s209124704', 's773429218', 's582643183'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [244, 242, 244] |
p03102 | u371409687 | 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 c... | ['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 Sum+=a[j]*b[j]\n if Sum>-1*c:\n Count+=1\n Sum=0\nprint(Count)', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\na=[list(... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s197389247', 's880269945', 's053485637'] | [3060.0, 3060.0, 3064.0] | [18.0, 18.0, 18.0] | [230, 238, 238] |
p03102 | u374051158 | 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 c... | ['N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = [list(map(int, input().split())) for _ in range(N)]\n\ncnt = 0\n\nfor a in A:\n print(sum([ta * tb for ta, tb in zip(a, B)]) + C)\n \n if(sum([ta * tb for ta, tb in zip(a, B)]) + C > 0):\n cnt += 1\n\nprint(cnt)', 'N, M, C =... | ['Wrong Answer', 'Accepted'] | ['s699444338', 's187759840'] | [3064.0, 3064.0] | [18.0, 17.0] | [293, 242] |
p03102 | u375282392 | 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 c... | ['n,m,c = map(int,input().split())\nb = list(map(int,input().split()))\n#a = []\ncount = 0\nfor i in range(n):\n\ta = list(map(int,input().split()))\n tokuten = 0\n\tfor j in range(m):\n\t\ttokuten += b[j]*a[j]\n\tif tokuten > c:\n\t\tcount += 1\n\nprint(count)', 'n,m,c = map(int,input().split())\nb = list(map(int,i... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s117505204', 's476798051', 's217121989'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [243, 232, 233] |
p03102 | u375616706 | 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 c... | ['# python template for atcoder1\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\n\ndef f(a):\n """\n xor [0,a]\n """\n ans = 0\n l = []\n d = 2\n while (a+1)//d > 0:\n t = (a+1)//d*(d//2)+max((a+1) % d-d//2, 0)\n ans += (t % 2)*(d//2)\n l.append(t % 2)\... | ['Runtime Error', 'Accepted'] | ['s940602710', 's675272793'] | [3064.0, 3060.0] | [17.0, 17.0] | [652, 325] |
p03102 | u387080888 | 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 c... | ['a=tuple(map(int,input().split()))\nb=[]\nfor i in range(a[0]+1):\n b.append(list(map(int,input().split())))\nans=0\ns=0\nfor j in range(a[0])[1:a[0]+1]:\n for k in range(a[1]):\n s+=b[j][k]*b[0][k]\n s+=a[2]\n if s>0:\n ans+=1\n s=0\nprint(ans)', 'a=tuple(map(int,input().split()))\nb=[]\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s484207407', 's567809978', 's764102044'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0] | [260, 258, 262] |
p03102 | u391819434 | 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 c... | ['N,M,C=input().split();*B,=input().split();print(sum(sum(int(a)*int(b) for a,b in zip(i.split(),B))+int(C)>0 for i in open(0)))', 'N,M,C=input().split()\n*B,=input().split()\nprint(sum(sum(int(a)*int(b) for a,b in zip(i.split(),B))+int(C)>0 for i in open(0)))', 'N,M,C=map(int,input().split())\n*B,=map(int,input().spli... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s596648984', 's690877521', 's427719212'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [126, 126, 166] |
p03102 | u393481615 | 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 c... | ['N, M, C = list(map(int, input().split()))\nB = list(map(int, input().split()))\nA = list([])\nfor i in range(N):\n A.append(list(map(int, input().split())))\n\ncnt = 0\nfor i in range(N):\n print("A= " + str(A[i]))\n print("B= " + str(B))\n print("C= " + str(C))\n ev = 0\n for j in range(M):\n ... | ['Wrong Answer', 'Accepted'] | ['s209576664', 's522014628'] | [3064.0, 3064.0] | [17.0, 19.0] | [398, 401] |
p03102 | u395237353 | 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 c... | ['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 x = C\n for index, val in enumerate(B):\n x += A[index] * val\n if x > 0:\n count += 1\n print(x)\nprint(count)\n', 'N, M, C = map(int, input().s... | ['Wrong Answer', 'Accepted'] | ['s568666358', 's124806092'] | [3060.0, 3060.0] | [18.0, 18.0] | [274, 261] |
p03102 | u396971285 | 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 c... | ['N,M,C=map(int, input().split())\n\n\n\n\nB=list(map(int,input.split()))\nA=[]\nfor i in range(N):\n a=map(int,input().split())\n A.append(a)\n \nans=0\nx=0\nfor i in range(N):\n for j in range(M):\n ans+=A[i][j]*B[j]\n if ans+C>0:\n x+=1\n\nprint(x)', 'N,M,C=map(int, input().split())\n\n\n\n\nB=list(ma... | ['Runtime Error', 'Accepted'] | ['s672673175', 's608789612'] | [3064.0, 3064.0] | [17.0, 17.0] | [334, 346] |
p03102 | u404676457 | 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 c... | ['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 z = 0\n for j in range(m):\n z += b[j] * a[j]\n if z + c >= 0:\n count += 1\nprint(count)', 'n, m, c = map(int, input().split())\nb = list(map(int, ... | ['Wrong Answer', 'Accepted'] | ['s327390704', 's534732167'] | [3060.0, 3188.0] | [17.0, 20.0] | [249, 248] |
p03102 | u409542115 | 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 c... | ['N, M, C = map(int, input().split()) \nB = list(map(int, input().split()))\n \nS = [[0]*M for i in range(N)]\nfor i in range:\n S[i] = list(map(int, input().split()))\n\nb = 0\n \nfor i in range(N... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s309010106', 's319241365', 's674278402', 's682975029', 's220747144'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 17.0, 18.0] | [429, 308, 429, 429, 435] |
p03102 | u416223629 | 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 c... | ['NMC = list(map(int,input().split()))\nN=NMC[0]\nM=NMC[1]\nC=NMC[2]\nB=list(map(int,input().split()))\nA = [list(map(int,input().split())) for l in range(N)]\ncnt=0\nsummary=0\nfor i in range(N):\n for j in range(M):\n summary=A[i][j]*B[j]+summary\n summary=summary+C\n print(summary)\n if summary>0:... | ['Wrong Answer', 'Accepted'] | ['s673792132', 's230130745'] | [3316.0, 3064.0] | [24.0, 17.0] | [336, 322] |
p03102 | u426108351 | 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 c... | ['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 point = c\n for i in range(m):\n point += a[i]*b[i]\n if point > 0:\n ans += 1\nprint(ans)', 'n, m, c = map(int, input().split())\nb = list(map(int, input().split()))... | ['Runtime Error', 'Accepted'] | ['s901929315', 's141318770'] | [3060.0, 3060.0] | [19.0, 17.0] | [232, 232] |
p03102 | u433380437 | 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 c... | ['\n# ABC121 B - Can you solve this?\n\nn,m,c=map(int,input().split())\nB = np.array(list(map(int,input().split())))\nK=[]\nfor i in range(n):\n A = list(map(int,input().split()))\n K.append(A)\n\nimport numpy as np\npp = np.array(K)\nl = (pp*B).sum(axis=1)+c\n\nt = 0\nfor i in range(len(l)):\n if l[i] > 0:\n ... | ['Runtime Error', 'Accepted'] | ['s569338820', 's272380867'] | [9124.0, 27276.0] | [24.0, 123.0] | [332, 333] |
p03102 | u434282696 | 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 c... | ['import numpy as np\nN,M,C = (int(j) for j in input().split())\nB = [int(j) for j in input().split()]\nlist = [[0]* M]*N\nfor j in range(0,N):\n list[j] = [int(k) for k in input().split()]\ncount = 0\nfor j in range(0,N):\n if np.sum(np.array(list[j]) * np.array(B)) C >0:\n count = count + 1\nprint(co... | ['Runtime Error', 'Accepted'] | ['s750333041', 's549917206'] | [2940.0, 12432.0] | [17.0, 151.0] | [312, 315] |
p03102 | u439312138 | 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 c... | ['from operator import mul\n\nN,M,C = map(int,input().split())\n\nB_list = list(map(int,input().split()))\n\nans = 0\n\nfor i in range(N):\n tmplist = list(map(int,input().split()))\n \n combined = list(map(mul,B_list,tmplist))\n if sum(combined) + C >= 0:\n ans += 1\n\nprint(ans)\n ', 'from operator import ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s386895198', 's817508417', 's636143902'] | [3060.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0] | [277, 294, 277] |
p03102 | u439392790 | 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 c... | ['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()))\nans=0\nfor i in range(n):\n C=c\n for j in range(m):\n C=C+a[i][j]*b[j]\n if C>0:\n ans=ans+1\nprint(ans)\n \n ', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split()))... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s143345698', 's185188684', 's186421346'] | [3060.0, 3060.0, 3064.0] | [18.0, 17.0, 18.0] | [237, 238, 235] |
p03102 | u440161695 | 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 c... | ['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 d=0\n for j,k in zip(A,B):\n d+=A*B\n if d>-C:\n ans+=1\nprint(ans)\n ', 'N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nans=0\nfor i in range(N):\n A=list(ma... | ['Runtime Error', 'Accepted'] | ['s327615539', 's092320282'] | [3060.0, 3064.0] | [18.0, 18.0] | [199, 196] |
p03102 | u441246928 | 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 c... | ['N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\nans = 0\nfor i in range(0,n) :\n A = list(int,input().split())\n Sum = C\n for (x,y) in zip(A,B):\n Sum += (x*y)\n if wa > 0 :\n ans += 1\nprint(ans)', 'N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s051829342', 's508527303', 's964105671', 's429629251'] | [3064.0, 3064.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [235, 236, 236, 241] |
p03102 | u442581202 | 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 c... | ['n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\ncnt =0\nfor i in range(n):\n a=list(map(int,input().split()))\n s=C+sum([b[j]*a[j] for j in range(m)])\n if s>0:\n cnt +=1\nprint(cnt)', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\ncnt =0\nfor i in range(n):\n a=list(map(i... | ['Runtime Error', 'Accepted'] | ['s449306470', 's893612496'] | [3060.0, 3064.0] | [17.0, 18.0] | [198, 199] |
p03102 | u450180547 | 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 c... | ['b = list(map(int, input().split()))\ncodes = [list(map(int, input().split())) for _ in range(N)]\n\nres = 0\nfor code in codes:\n s = C \n for i in range(M):\n s += (code[i] * b[i])\n if s > 0:\n res += 1\n\nprint(res)\n', 'N, M, C = map(int, input().split())\nb = list(map(int, input().split... | ['Runtime Error', 'Accepted'] | ['s855740347', 's486772729'] | [2940.0, 3060.0] | [17.0, 17.0] | [234, 271] |
p03102 | u455177911 | 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 c... | ['import numpy', "import numpy as np\n\nn, m, c = [int(x) for x in input().split(' ')]\nb = np.asarray([int(x) for x in input().split(' ')])\n\na = np.ndarray((n, m), dtype=np.int32)\nfor i in range(n):\n a[i] = [int(x) for x in input().split(' ')]\n\n\ns = np.sum(a * b, axis=1)\nprint(np.sum(s + c > 0))\n"] | ['Wrong Answer', 'Accepted'] | ['s082140198', 's420350212'] | [12488.0, 12428.0] | [149.0, 149.0] | [12, 280] |
p03102 | u456566864 | 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 c... | ['from sys import stdin\n\nN, M, C = map(int, stdin.readline().split())\nB = list(map(int, stdin.readline().split()))\nans = 0\nfor i in range(N):\n if sum(list(map(int, stdin.readline().split())), C) > 0:\n ans += 1\n \nprint(ans)', 'from sys import stdin\n\nN, M, C = map(int, stdin.readline().split())\nB = lis... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s404125632', 's865346878', 's946744996'] | [3060.0, 3060.0, 3060.0] | [17.0, 18.0, 18.0] | [227, 286, 288] |
p03102 | u457901067 | 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 c... | ['N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(N):\n work = C\n for j in range(M):\n work += A[j] * B[j]\n if work >= 0:\n ans += 1\n \nprint(ans)', 'N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\n\nans = 0\n\nfor i in range... | ['Runtime Error', 'Accepted'] | ['s341699386', 's856952385'] | [3060.0, 3060.0] | [18.0, 18.0] | [201, 238] |
p03102 | u458608788 | 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 c... | ['n,m,c=map(int,input().split())\nb=map(int,input().split())\na=0\nfor _ in range(n):\n a=map(int,input().split())\n s=0\n for i in range(m):\n s+=a[i]*b[i]\n if s > -c:\n a+=1\nprint(a)', 'n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\nr=0\nfor _ in range(n):\n a=list(map(int,input().spli... | ['Runtime Error', 'Accepted'] | ['s007980807', 's063534198'] | [2940.0, 3060.0] | [17.0, 18.0] | [184, 196] |
p03102 | u466143662 | 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 c... | ['a,b,c = map(int, input().split())\n\nlistB = list(map(int, input().split()))\n\nlistA = [list(map(int, input().split())) for _ in range(a)]\nt=0\n\nfor i in range(a):\n ans=0\n for i in range(b-1):\n s=listB[i]*listA[i]\n s=sum(s)\n ans= ans+s\n if ans+c>0:\n t+=1\nprint(t)', 'imp... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s104494067', 's576950057', 's940376411', 's421852660'] | [3060.0, 12584.0, 12396.0, 12472.0] | [24.0, 156.0, 151.0, 156.0] | [296, 260, 235, 260] |
p03102 | u475598608 | 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 c... | ['N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nA=list(list(map(int,input().split()))for i in range(N))\nprint(A)\ncount=0\ntotal=0\nfor i in range(N):\n for j in range(M):\n total+=A[i][j]*B[j]\n if total>-C:\n count+=1\n total=0\nprint(count)', 'N,M,C=map(int,input().spl... | ['Wrong Answer', 'Accepted'] | ['s521287862', 's526496912'] | [3064.0, 3060.0] | [17.0, 17.0] | [277, 233] |
p03102 | u478296955 | 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 c... | ['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 k in range(m):\n p = c\n p += a[k]*b[k]\n if p>0: count+=1\nprint(count)', 'n,m,c = map(int, input().split())\nb = list(map(int, input().split()))\ncount = 0\nfo... | ['Wrong Answer', 'Accepted'] | ['s124242378', 's087873192'] | [3064.0, 3064.0] | [18.0, 18.0] | [220, 216] |
p03102 | u479719434 | 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 c... | ['N,M,C = [int(x) for x in input().split()]\nB = [int(x) for x in input().split()]\nA = [[int(x) for x in input().split()] for i in range(N)]\n\nfor i in range(N):\n sum = C\n for j in range(M):\n sum += A[i][j]*B[j]\n print(sum,sum>0)', 'N,M,C = [int(x) for x in input().split()]\nB = [int(x) for x in i... | ['Wrong Answer', 'Accepted'] | ['s529781375', 's160615246'] | [3316.0, 3316.0] | [23.0, 19.0] | [241, 274] |
p03102 | u480038302 | 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 c... | ['n,m,c = map(int,input().split())\nls1 = list(map(int,input().split()))\nls2 = [list(map(int,input().split())) for i in range(n)]\nprint(ls1)\nprint(ls2)\nls = []\nfor i in range(n):\n a = 0\n for j in range(m):\n a += ls2[i][j]*ls1[j]\n a += c\n if a > 0:\n ls.append(1)\nprint(len(ls))', 'n,... | ['Wrong Answer', 'Accepted'] | ['s534445363', 's956966137'] | [3064.0, 3188.0] | [17.0, 20.0] | [299, 275] |
p03102 | u480568292 | 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 c... | ['import numpy as np\n\ns,d,f = map(int,input().split())\n\nn_ln = []\nnn = []\nvv = []\nn_l = list(map(int,input().split()))\n\nfor i in range(s):\n n_ln.append(n_l)\n\nfor i in range(s):\n A = list(map(int,input().split()))\n nn.append(A)\n\nX = np.array(n_ln,dtype=np.int64)\nY = np.array(nn,dtype=np.int64)\nZ = X... | ['Wrong Answer', 'Accepted'] | ['s796906536', 's715462051'] | [12408.0, 3060.0] | [150.0, 18.0] | [474, 204] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.