Problem:


Score : 200 points

Problem Statement

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.

Constraints

All values in input are integers.

1 \leq N, M \leq 20

-100 \leq A_{ij} \leq 100

-100 \leq B_i \leq 100

-100 \leq C \leq 100

Input

Input is given from Standard Input in the following format:

N M C
B_1 B_2 ... B_M
A_{11} A_{12} ... A_{1M}
A_{21} A_{22} ... A_{2M}
\vdots
A_{N1} A_{N2} ... A_{NM}

Output

Print the number of codes among the given N codes that correctly solve this problem.

Sample Input 1

2 3 -10
1 2 3
3 2 1
1 2 2

Sample Output 1

1

Only the second code correctly solves this problem, as follows:

Since 3 \times 1 + 2 \times 2 + 1 \times 3 + (-10) = 0 \leq 0, the first code does not solve this problem.

1 \times 1 + 2 \times 2 + 2 \times 3 + (-10) = 1 > 0, the second code solves this problem.

Sample Input 2

5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13

Sample Output 2

2

Sample Input 3

3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100

Sample Output 3

0

All of them are Wrong Answer. Except yours.



Sample input:
2 3 -10
1 2 3
3 2 1
1 2 2


Sample output:
1

Submission status: Wrong Answer

Solution code:
import numpy as np
n,m,c=map(int,input().split())
b=np.array(list(map(int,input().split())))
ans=0
cnt=0
for i in range(0,n):
  a=np.array(list(map(int,input().split())))
  x=a*b
  
  for j in range(0,m):
    cnt+=x[j]
  cnt+=c  
  
  if cnt>0:
    ans+=1
    
print(ans)

Submission status: Wrong Answer

Solution code:
N , M ,C  = map(int,input().split())
B = list(map(int, input().split()))

count = 0
for i in range(N):
    A = list(map(int, input().split()))
    p = C
    for j in range(M):
        p+= A[j]*B[j]
        if p > 0:
            count+=1
print(count)

Submission status: Wrong Answer

Solution code:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
AC = 0
x = C
for i in range(N):
    A = list(map(int,input().split()))
    for j in range(M):
        x += A[j]*B[j]
    if x > 0:
        AC += 1
print(AC)

Submission status: Wrong Answer

Solution code:
N,M,C=map(int, input().split())
B=list(map(int, input().split()))
ans=0
for i in range(N):
    A=list(map(int, input().split()))
    tmp=0
    for j in range(M):
        tmp+=A[j]*B[j]
        if tmp+C>0:
            ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np
n, m, c = list(map(int, input().split()))
b = np.array(list(map(int, input().split())))
count = 0
print(b)
for i in range(n):
    a = np.array(list(map(int, input().split())))
    result = sum(a*b) + c
    print(result)
    if result > 0:
        count += 1
print(count)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
B = list(map(int,input().split()))
L = [list(map(int,input().split())) for i in range(n)]

ans = 0
for i in range(n):
      acm = 0
      for j in range(m):
            acm += L[i][j] * B[j]
      if acm - c > 0:
            ans += 1      

print(ans)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
B = list(map(int,input().split()))
L = [list(map(int,input().split())) for i in range(n)]

ans = 0
for i in range(n):
      acm = 0
      for j in range(m):
            acm += L[i][j] * B[j]
      if acm - 10 > 0:
            ans += 1      

print(ans)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())

B = list(map(int,input().split()))
L = [list(map(int,input().split())) for i in range(n)]

ans = 0
acm = 0
for i in range(n):
      for j in range(m):
            acm += L[i][j] * B[j]
      if acm - 10 > 0:
            ans += 1      

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np
n, m, c = map(int, input().split())
B = np.array([list(map(int, input().split()))])
count = 0
for i in range(n):
  ab = np.array([list(map(int, input().split()))])
  if abs(np.dot(ab, B.T)) + c > 0:
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
N , M, C = list(map(int,input().split()))
b = list(map(int,input().split()))
A = []
for i in range(N):
    a = list(map(int,input().split()))
    A.append(a)
result = 0
count = 0
for h in range(len(A)):    
    for j in range(M):
        result += b[j] * A[h][j]
    if result + C <= 0:
        pass
    else:
        count +=1
print(count)

Submission status: Wrong Answer

Solution code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
res = 0
temp = C
for i in range(N):
  for j in range(M):
    temp += A[i][j] * B[j]
  if temp > 0:
    temp = C
    res += 1
print(res)

Submission status: Wrong Answer

Solution code:
import numpy as np

N, M, C = map(int, input().split())
B = list(map(int, input().split()))
B = np.array(B)
A = []
for n in range(N):
    a = list(map(int, input().split()))
    A.append(a)
A = np.array(A, dtype=int)
B_new = np.array([B, B])
count = 0
for i in range(N):
  score = A[i] * B
  if score.sum() > C:
    count += 1


print(count)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split())) for k in range(n)]

count=0

for i in range(n):
  absum=0
  for j in range(m):
    absum+=a[i][j]*b[j]
    
    ans=absum+c
    if ans>0:
      count+=1
      
      print(count)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int, input().split())
b = list(map(int, input().split()))
count = 0
for i in range(n):
  a = list(map(int, input().split()))
  p = c
  for k in range(m):
    p += a[k]*b[k]
    if p>0: count+=1
print(count)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int, input().split())
b = list(map(int, input().split()))
count = 0
for i in range(n):
  a = list(map(int, input().split()))
  for k in range(m):
    p = c
    p += a[k]*b[k]
    if p>0: count+=1
print(count)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
count=0
ans=0
for i in range(n):
    a=list(map(int,input().split()))
    for j in range(m):
        ans+=a[j]*b[j]
    if ans+c>0:
        count+=1
            
print(count)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
count=0
ans=0
for i in range(n):
    a=list(map(int,input().split()))
    for j in range(m):
        ans+=a[j]*b[j]
        print(ans)
    if ans+c>0:
        count+=1
            
print(count)

Submission status: Wrong Answer

Solution code:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
count = 0
s = 0
for _N in range(N):
  A = list(map(int,input().split()))
  for _M in range(M):
    s+=A[_M]*B[_M]
    print(s)
  if s+C>0:
    count+=1
    print(count)
    print()
print(count)

Submission status: Wrong Answer

Solution code:
from operator import mul

N,M,C = map(int,input().split())

B_list = list(map(int,input().split()))

ans = 0

for i in range(N):
  tmplist = list(map(int,input().split()))
  
  combined = list(map(mul,B_list,tmplist))
  print(combined)
  if sum(combined)  + C > 0:
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
from operator import mul

N,M,C = map(int,input().split())

B_list = list(map(int,input().split()))

ans = 0

for i in range(N):
  tmplist = list(map(int,input().split()))
  
  combined = list(map(mul,B_list,tmplist))
  if sum(combined)  + C >= 0:
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
from operator import mul

N,M,C = map(int,input().split())

B_list = list(map(int,input().split()))

ans = 0

for i in range(N):
  tmplist = list(map(int,input().split()))
  
  combined = list(map(mul,B_list,tmplist))

  if sum(combined)  + C <= 0:
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
check = 0
d = 0
for i in range(n):
    A = list(map(int,input().split()))
    for j in range(m):
        d += b[j]*A[j]
    if d+c > 0:
        check += 1

print(check)

Submission status: Wrong Answer

Solution code:
N,M,C = map(int,input().split())
Bn = map(int,input().split())
ans=0
for n in range(N):
    As = map(int,input().split())
    if sum([x*y for (x,y) in zip(As,Bn)])>C:
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
count = 0
 
for i in range(n):
  a = list(map(int, input().split()))
  p = c
  for j in range(m):
  	p += a[j] + b[j]
  if 0 < p:
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
B=list(map(int,input().split()))
count=0
for i in range(n):
  p=c
  A=list(map(int,input().split()))
  for j in range(m):
    p+=A[j]*B[j]
    if p>0:count+=1
print(count)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
	a = list(map(int,input().split()))
	tokuten = 0
	for j in range(m):
		tokuten += b[j]*a[j]
	if tokuten > c:
		count += 1

print(count)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
B = [int(i) for i in input().split()]
A = [list(map(int, input().split())) for i in range(n)]

count = 0
for low in range(n):
    Sum = c
    for col in range(m):
        Sum += A[low][col]*B[col]

    if Sum >= 0:
        count += 1

print(count)

Submission status: Wrong Answer

Solution code:
import numpy as np

s,d,f = map(int,input().split())

n_ln = []
nn = []
vv = []
n_l = list(map(int,input().split()))

for i in range(s):
  n_ln.append(n_l)

for i in range(s):
  A = list(map(int,input().split()))
  nn.append(A)

X = np.array(n_ln,dtype=np.int64)
Y = np.array(nn,dtype=np.int64)
Z = X*Y

col_sum = np.prod(Z, axis=1)

def calc_(n):
    return n + f
  
data = calc_(col_sum)


count= 0

for h in data:
  if h>0:
    count += 1
  else:
    pass
  
print(count)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = [int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(n)]
check = c
ans = 0
for i in range(n):
    for j in range(m):
        check += a[i][j]*b[j]
    if check > 0:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = [int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(n)]
check = 0
ans = 0
for i in range(n):
    for j in range(m):
        check += a[i][j]*b[j]
    check += 0
    if check > 0:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = [int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(n)]
check = 0
ans = 0
for i in range(n):
    for j in range(m):
        check += a[i][j]*b[j]
    check += c
    if check > 0:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int, input().split())
B=[int(x) for x in input().split()]

sum=0
count=0

for i in range(0,n):
    A=[int(n) for n in input().split()]
    for j in range(0,m):
        sum+=A[j]*B[j]
    if sum-abs(c)>0:
        count+=1
    sum=0

print(count)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(map(int,input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
ans = 0

for i in range(0,n-1):
    for j in range(0, m-1):
        ans1 = 0
        ans1 = b[j]*a[i][j]
    if ans1-c > 0:
        ans += 1
        ans1 = 0
    else:
        ans1 = 0

print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(map(int,input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
ans = 0

for i in range(n):
    for j in range(m):
        ans1 = 0
        ans1 = b[j]*a[i][j]
    if ans1-c > 0:
        ans += 1
        ans1 = 0
    else:
        ans1 = 0

print(ans)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
ans = 0
for i in range(n):
    A = list(map(int,input().split()))
    for j in range(m):
        ans += A[j]*b[j]
    ans = ans + c
    if ans > 0:
        count+= 1
print(count)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
tmp = 0
for i in range(n):
    A_i = list(map(int,input().split()))
    for _ in range(len(A_i)):
        ans = A_i[_]*b[_] + c
    if ans >= 0:
        tmp = tmp + 1
print(tmp)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))

count = 0
for i in range(0, n - 1):
    a = list(map(int, input().split()))
    s = 0
    for j in range(0, m - 1):
        s += a[j] * b[j]
    if s + c > 0:
        count += 1
print(count)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
cnt = 0
for i in range(n):
  a = list(map(int,input().split()))
  for j in range(m):
    sum = 0
    sum += (a[j]*b[j])
  sum += c
  if sum > 0:
    cnt += 1
  else:
    pass
print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
cnt = 0
sum = 0
for i in range(n):
  a = list(map(int,input().split()))
  for j in range(m):
    sum += (a[j]*b[j])
  sum += c
  if sum > 0:
    cnt += 1
  else:
    pass
print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = [[int(i) for i in input().split()] for i in range(n)]
condition = 0
count = 0
for i in range(n):
  for k in range(m):
    condition += a[i][k] * b[k]
  if condition + c > 0:
    count += 1
print(int(count))

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
B=list(map(int,input().split()))
A=[list(map(int,input().split()))for i in range(n)] #二次元配列でとっています
cnt=0
for i in range(n):
  total=0
  for j in range(m):
    total+=B[j]*A[i][j]
    total+=c
    if 0<total:
      cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
B=list(map(int,input().split())) 
A=[list(map(int,input().split()))for i in range(n)] 
cnt=0 
for i in range(n):
  total = 0
  for j in range(m):
    total+=B[j]*A[i][j]
    total+=c
    if total>0:
      cnt+=1  
print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
B=list(map(int,input().split())) 
A=[list(map(int,input().split()))for i in range(n)] 
cnt=0 
for i in range(n):
    total = 0
    for j in range(m):
        total+=B[j]*A[i][j]
        total+=c
        if total>0:
          cnt+=1  
print(cnt)

Submission status: Wrong Answer

Solution code:
N,M,c = map(int,input().split())
 
B = list(map(int,input().split()))
 
A = [list(map(int,input().split()))for i in range(N)]
 
cnt = 0
 
for i in range(N):
  total = 0
  for j in range(M):
    total+=B[j]*A[i][j]
  total+=c

if total>0:
  cnt+=1
  
print(cnt)

Submission status: Wrong Answer

Solution code:

N,M,C = map(int,input().split())

B = list(map(int,input().split()))

A = [list(map(int,input().split()))for i in range(N)]

cnt = 0

for i in range(N):
  total = 0
  for j in range(M):
    total += B[j]*A[i][j]

total += C

if total >0 :
  cnt += 1
  
print(cnt)

Submission status: Wrong Answer

Solution code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))

correct_answer = 0
sum_AB = 0

for i in range(N):
    A = list(map(int, input().split()))
    
    for j in range(M):
        sum_AB += A[j]*B[j]
    if sum_AB + C > 0:
        correct_answer += 1

print(correct_answer)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
a = input().split()
a = [int(x) for x in a]

d = 0
e = 0
for i in range(n):
    b = input().split()
    b = [int(x) for x in b]
    for j in range(m):
        d += b[j]*a[j]
    print(d)
    if d + c >0:
        e += 1
    d = 0
print(e)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int, input().split())
b=list(map(int, input().split()))
tmp=0
cnt=0
a_i=[]
for _ in range(n):
    a=list(map(int, input().split()))
    tmp=0
    for i in range(m):
        print(a[i],b[i])
        tmp+=int(a[i])*int(b[i])
    
    if tmp+c>0:
        cnt+=1
        
print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int, input().split())
b=list(map(int, input().split()))
tmp=0
cnt=0
a_i=[]
for _ in range(n):
    a=list(map(int, input().split()))
    for i in range(m):
        tmp=0
        tmp+=int(a[i])*int(b[i])
    if tmp+c>0:
        cnt+=1
        
print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int, input().split())
b=list(map(int, input().split()))

cnt=0
a_i=[]
for _ in range(n):
    a=list(map(int, input().split()))
    for i in range(m):
        tmp=0
        tmp+=int(a[i])*int(b[i])
    if tmp+c>0:
        cnt+=1
        
print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int, input().split())
b=list(map(int, input().split()))
tmp=0
cnt=0
a_i=[]
for _ in range(n):
    a=list(map(int, input().split()))
    for i in range(m):
        tmp+=int(a[i])*int(b[i])
    if tmp+c>0:
        cnt+=1
        tmp=0
print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int, input().split())
b=list(map(int, input().split()))
tmp=0
cnt=0
a_i=[]
for _ in range(n):
    a=list(map(int, input().split()))
    for i in range(m):
        tmp=int(a[i])*int(b[i])
    if tmp+c>0:
        cnt+=1
        tmp=0
print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int, input().split())
b=list(map(int, input().split()))
tmp=0
cnt=0
a_i=[]
for _ in range(n):
    a=list(map(int, input().split()))
    for i in range(m):
        tmp=int(a[i])*int(b[i])
    if tmp+c>0:
        cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
N, M, C = (map(int, input().split()))
B = list((map(int, input().split())))
counter = 0
for i in range(N):
	tmp = list((map(int, input().split())))
	total = C
	for j in range(M):
		total += B[j] * tmp[j]
		if total > 0:
			counter += 1
			break
			
print(counter)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
ans=0
for i in range(n):
    a=list(map(int,input().split()))
    d=0
    for j in range(m):
       d+=a[j]*b[j]
    d+=c
    if(d<=0):
        continue
    else:
     ans=i
print(ans)

Submission status: Wrong Answer

Solution code:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
A = []
for i in range(N):
    A.append(list(map(int,input().split())))
    for j in range(M):
        S = C
        S += A[i][j] * B[j]
    if S > 0:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N, M, C = map(int, input().split())
B = [int(i) for i in input().split()]
A = [[int(i) for i in input().split()] for j in range(N)]
judge = 0
count = 0

for i in range(N):
    for j in range(M):
        judge += B[j] * A[i][j]
    if judge + C > 0:
        count += 1

print(count)

Submission status: Wrong Answer

Solution code:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
K = []
S = 0
ans = 0
J = []
for i in range(N):
  K.append(list(map(int,input().split())))
for i in range(N):
  for j in range(M):
    S += K[i][j]*B[j]
  S = S + C
  J.append(S)
for i in range(N):
  if J[i] >0:
    ans += 1
  else:
    ans += 0
print(ans)

Submission status: Wrong Answer

Solution code:
n, m , c = map(int, input().split())
b_li = list(map(int, input().split()))
ans = 0
for i in range(n):
    a_li = list(map(int, input().split()))
    if (0 < a * b + c for a, b in zip(a_li, b_li)):
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
li = []
for i in range(n+1):
	li.append(list(map(int,input().split())))

cnt = 0
for i in range(1,n):
  tmp = 0
  for j in range(m):
    tmp += li[i][j] * li[0][j]
  tmp += c
  if tmp > 0:
    cnt += 1
    
print(cnt)

Submission status: Wrong Answer

Solution code:
nmc = input().split()
lstb = input().split()
a = []
for n in range(int(nmc[0])):
    a.append(input().split())
total = 0
count = 0
for n in range(int(nmc[0])):
    for m in range(int(nmc[1])):
        total += (int(lstb[m]) * int(a[n][m]))
    if total - int(nmc[2]) > 0:
        count += 1
    total = 0
print(count)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
b=[int(i) for i in input().split()]
a=[[int(i) for i in input().split()] for j in range(n)]
count = 0
ans = 0
for j in range(n):
    count = 0
    for i in range(m):
        count += b[i]*a[j][i]
    if count-10>0:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
b=[int(i) for i in input().split()]
a=[[int(i) for i in input().split()] for j in range(n)]
count = 0
ans = 0
for j in range(n):
    count = 0
    for i in range(m):
        count += b[i]*a[j][i]
        if count-10>0:
            ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
for i in range(N):
  A=list(map(int,input().split()))
  s=C
  for a,b in zip(A,B):
    s=s+a*b
print(s)

Submission status: Wrong Answer

Solution code:
N,M,C=map(int, input().split())
B=list(map(int, input().split()))
A=[]
ans=0
a=0
for i in range(N):
    A.append([int(j) for j in input().split()])
for i in range(N):
    for j in range(M):
         a+=A[i][j]*B[j]
    if a+C>0:
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
N,M,C=map(int, input().split())
B=list(map(int, input().split()))
A=[]
ans=0
a=0
for i in range(N):
    A.append([int(j) for j in input().split()])
for i in range(N):
    for j in range(M):
         a+=A[i][j]*B[j]
    if a+C==0:
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np
from operator import mul
from functools import reduce

N, M, C = [int(x) for x in input().split()]
B = np.array([int(x) for x in input().split()])
#A = np.array([[0]*M,N])
A = np.empty((N,M))

result = np.array([])
count = 0

for n in range(N):
    A[n] = [int(m) for m in input().split()]
    result = A[n-1] * B
    #print(result)
    if sum(result)+C > 0:
        count +=1
print(count)

Submission status: Wrong Answer

Solution code:
#Coding:Utf-8

N,M,C=map(int, input().split())

B=list(map(int, input().split()))
count=total=0

for j in range(N):
  A=list(map(int, input().split()))
  for k in range(M):
    total=total+(A[k]*B[k])
  else:
    if total+C>0:
      count+=1
      total=0

print(count)

Submission status: Wrong Answer

Solution code:
N,M,C=map(int, input().split())
B=list(map(int, input().split()))

count=0
for i in range(N):
  A = list(map(int, input().split()))
  sum=0
  for j in range(M):
    sum+=B[j]*A[j]
    if sum+C>0:
      count+=1

print(count)

Submission status: Wrong Answer

Solution code:
N,M,C = map(int,input().split())
B = [int(x) for x in input().split()]
 
count = 0
for i in range(N):
  temp = [int(x) for x in input().split()]
  total = [B[i]*temp[i] for i in range(M)]
  if((sum(total) - C) > 0 ):
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
N,M,C = map(int,input().split())
B = [int(x) for x in input().split()]
 
count = 0
for i in range(N):
  temp = [int(x) for x in input().split()]
  total = [B[i]*temp[i] for i in range(M)]
  if(sum(total) > 0 ):
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
NMC = list(map(lambda x: int(x), input().split()))
N = NMC[0]
M = NMC[1]
C = NMC[2]

B = list(map(lambda x: int(x), input().split()))
A = [list(map(lambda x: int(x), input().split())) for i in range(N)]

print("B", B)
print("A", A)
print("N", N)
print("M", M)
print("C", C)

answer = 0

for i in range(len(A)):
  judge = 0
  for m in range(len(A[i])):
    judge += A[i][m] * B[m]

  print("judge", judge)
  if (judge + C > 0):
    answer += 1

print(answer)

Submission status: Wrong Answer

Solution code:
#coding:utf-8

N, M, C = map(int, input().split())

B = list(map(int, input().split()))

sumlist = []
cnt = 0

for i in range(N):
    A = list(map(int, input().split()))
    for j in range(M):
        sumlist.append(A[j]*B[j])
    if sum(sumlist) + C > 0:
        cnt += 1
        sumlist = []

print(cnt)

Submission status: Wrong Answer

Solution code:
n,m,c = map(int,input().split())
b = [i for i in map(int,input().split())]
a = []
for j in range(n):
    a.append( [i for i in map(int,input().split())] )


ans = [0]*(n)
count = 0
print(ans)
for i in range(n) :
    for j in range(m):
        ans[i] += a[i][j] * b[j]
    if ans[i] + c > 0 :
        count += 1 
print(count)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

n, m, c = map(int, input().split())
numB = [int(s) for s in input().split()]
codeA = []
for _ in range(n):
    codeA.append([int(t) for t in input().split()])
    
count = 0
for a in codeA:
    total = 0
    for i in range(m):
        total += a[i]*numB[i]
        if total + c > 0:
            count += 1
            
print(count)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(int(x) for x in input().split())
ans = 0

for j in range(n):
    a = list(int(x) for x in input().split())
    sum = 0
    for i in range(m):
        sum += a[i]*b[i]
        if sum > -c:
            ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(int(x) for x in input().split())
ans = 0

for j in range(n):
    a = list(int(x) for x in input().split())
    sum = 0
    for i in range(m):
        sum = 0
        sum += a[i]*b[i]
        if sum > -c:
            ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(int(x) for x in input().split())
ans = 0

for j in range(n):
    a = list(int(x) for x in input().split())
    for i in range(m):
        sum = 0
        sum += a[i]*b[i]
        if sum > -c:
            ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
num = c
count = 0
for i in range(n):
  a = list(map(int, input().split()))
  for j in range(m):
    num += a[j]*b[j]
  print(num)
  if num > 0:
    count += 1
    num = c
  else:
    num = c
print(count)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
num = c
count = 0
for i in range(n):
  a = list(map(int, input().split()))
  for j in range(m):
    num += a[j]*b[j]
  if num > 0:
    count += 1
    num = c
print(count)

Submission status: Wrong Answer

Solution code:
N,M,C=map(int,input().split())
A=[list(map(int,input().split())) for _ in range(N)]
print(len([i for i in range(N) if sum([A[i][j] for j in range(M)]) + C > 0]))

Submission status: Wrong Answer

Solution code:
N,M,C=map(int,input().split())
b=list(map(int,input().split()))
a=list(range(N))
for i in range(N):
    a[i]=list(map(int,input().split()))
ab=list(range(N))
count=0

for i in range(N):
    ab[i]=0
    for j in range(M):
        ab[i]+=a[i][j]*b[j]
    if ab[i]+C>0:
        count+=1

print(count)
print(ab)

Submission status: Wrong Answer

Solution code:
N,M,C=map(int,input().split())
b=list(map(int,input().split()))
a=list(range(N))
for i in range(N):
    a[i]=list(map(int,input().split()))
ab=list(range(N))
count=0

for i in range(N):
    for j in range(M):
        ab[i]=0
        ab[i]+=a[i][j]*b[j]
    if ab[i]+C>0:
        count+=1

print(count)
print(ab)

Submission status: Wrong Answer

Solution code:
N,M,C=map(int,input().split())
b=list(map(int,input().split()))
a=list(range(N))
for i in range(N):
    a[i]=list(map(int,input().split()))
ab=list(range(N))
count=0

for i in range(N):
    for j in range(M):
        ab[i]+=a[i][j]*b[j]
    if ab[i]+C>0:
        count+=1

print(count)

Submission status: Wrong Answer

Solution code:
import numpy as np

N,M,C = map(int,input().split())
B=np.array(list(map(int,input().split())))
ans=0

for i in range(N):
  A=np.array(list(map(int,input().split())))
  if sum(A-B)-C > 0:
    ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
alist=[list(map(int,input().split())) for i in range(n)]
s=0
ans=0
for j in range(n):
      for k in range(m):
            s+=alist[j][k]*b[k]
      if s+c>0:
            ans+=1
            s=0
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c=map(int, input().split())
b=list(map(int, input().split()))
x=0
for _ in range(n):
	s=list(map(int, input().split()))
	z=c
	for i in range(m):
		z+=s[i]*b[i]
		if z>0:
			x+=1
print(x)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int,input().split())
B = list(map(int,input().split()))
A = [input().split() for l in range(n)]
cnt = 0
sum = 0
for i in range(n):
    for j in range(m):
        sum += int(A[i][j]) * B[j]
    if sum + c > 0:
        cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int,input().split())
B = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(n)]
cnt = 0
sum = 0
for i in range(n):
    for j in range(m):
        sum += A[i][j] * B[j]
    if sum + c > 0:
        cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
i = 0
count = 0
while i < N:
    A = list(map(int, input().split()))
#    print ('A', A)
    j = 1
    ans = C
    while j <= M:
        ans +=  A[j-1] * B[j-1]
        j += 1
#    print (ans)
    if ans > 0:
        count += 1
    i += 1
print ('Count', count)

Submission status: Wrong Answer

Solution code:
import numpy as np
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
A = [[int(i) for i in input().split()] for i in range(n)]
B = np.array(b).reshape(m,1)

Submission status: Wrong Answer

Solution code:
N,M,C = map(int, input().split())
B = list(map(int, input().split()))
ans=0
for i in range(N):
    A = list(map(int, input().split()))
    ssum = sum([A[i]*B[i] for i in range(M)])+C
    if ssum>=0:
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
code = 0

for i in range(n):
    a = list(map(int, input().split()))
    
    for j in range(m):
        code += a[j] * b[j]
    
    code += c
    if code > 0:
        ans += 1
        
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
code = 0

for i in range(n):
    a = list(map(int, input().split()))
    
    for j in range(m):
        code += a[j] * b[j]
    
    code -= c
    if code > 0:
        ans += 1
    code = 0

print(ans)

Submission status: Wrong Answer

Solution code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
code = 0

for i in range(n):
    a = list(map(int, input().split()))
    
    for j in range(m):
        code += a[j] * b[j]
    
    code -= c
    if code > 0:
        ans += 1
        
print(ans)