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: Accepted

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)]
b=c
d=0
for i in range(n):
  for j in range(m):
    b+=(a[i][j]*B[j])
  if b>0:
    d+=1
  b=c
print(d)

Submission status: Accepted

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 ai in A:
    s = C
    for a, b in zip(ai, B):
        s += a * b
    if s > 0:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
N,M,C = list(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):
    x=0
    for j in range(M):
        x += A[i][j] * B[j]
    x += C
    if x>0:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
def main():
    NMC = list(map(int, input().split()))
    N, M, C = NMC[0], NMC[1], NMC[2]
    B = list(map(int, input().split()))
    A = [input() for i in range(N)]
    ans = 0
    sum = 0
    cnt = 0
    for j in range(len(A)):
        sample = list(map(int, A[j].split()))
        for k in range(len(sample)):
            sum += sample[k]*B[k]
        sum = sum + C
        cnt += 1
        if sum > 0:
            ans += 1
        sum = 0
    print(ans)
main()

Submission status: Accepted

Solution code:
import numpy as np

N,M,C=map(int,input().split())
b=np.array([i for i in map(int,input().split())])
a=np.zeros((N,M))
for i in range(N):
    a[i,:]=np.array([i for i in map(int,input().split())])
print((((a*b).sum(axis=1)+C)>0).sum())

Submission status: Accepted

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):
    nai = 0
    for j in range(m):
        nai += a[i][j]*b[j]
    if nai+c>0:
        cnt += 1
        
print(cnt)

Submission status: Accepted

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

# 解の個数
c = 0

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

Submission status: Accepted

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

Submission status: Accepted

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()))
    sum = 0
    for j in range(M):
        sum += A[j]*B[j]
    sum += C
    if sum > 0:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
N, M, C = [int(c) for c in input().split()]

B = [int(c) for c in input().split()]

count = 0
for _ in range(N):
    A = [int(c) for c in input().split()]
    if sum(a*b for a, b in zip(A, B)) + C > 0:
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
n, m, c = input().split()
n, m, c = int(n), int(m), int(c)
b = np.array([int(x) for x in input().split()])
counter = 0
for i in range(n):
  temp = np.array([int(x) for x in input().split()])
  if np.dot(temp.T, b) + c > 0:
    counter += 1
print(counter)

Submission status: Accepted

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

A=[]


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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M, C =[int(x) for x in input().split()]
B = [int(x) for x in input().split()]
cnt = 0
for _ in range(N):
  A = [int(x) for x in input().split()]
  P = sum([a * b for (a, b) in zip(A, B)])
  if P > -C:
    cnt += 1
print(cnt)

Submission status: Accepted

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

print(counter)

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for l in range(x[0])]

count = 0
for i in range(x[0]):
  t = x[2]
  for j in range(x[1]):
    t += a[i][j] * b[j]
  if t > 0:
    count+=1
print(count)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

count = 0

for i in range(N):
  sigma = 0
  total = 0
  lst_a = list(map(int, input().split()))
  for k in range(M):
    multi = lst_a[k] * lst_b[k]
    sigma += multi
    total = sigma + C
  if total > 0:
    count += 1
print(count)

Submission status: Accepted

Solution code:
counts, numbers, plus = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]

counter = 0
for i in range(counts):
    a = [int(j) for j in input().split()]
    c = 0
    for k in range(numbers):
        c += a[k] * b[k]
    if c + plus > 0:
        counter += 1

print(counter)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(map(int, input().split()))
N = S[0]
M = S[1]
C = S[2]
AB = [list(map(int, input().split())) for i in range(N+1)]

B = AB[0]
Sum = 0
cnt = 0
for i in range(N):
    for j in range(M):
        Sum += AB[i+1][j] * B[j]
    if(Sum+C>0):
        cnt+=1
    Sum=0
print(cnt)
1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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()))
    now=0
    for j in range(m):now+=a[j]*b[j]
    if now>-c:ans+=1
print(ans)

Submission status: Accepted

Solution code:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
k=0
cnt = 0
a=[]

for i in range(N):
    a.append(list(map(int, input().split())))

for i in range(N):
    for j in range(M):
        k += B[j]*a[i][j]
    if k + C > 0:
        cnt += 1
    k = 0
    
print(cnt)

Submission status: Accepted

Solution code:
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
k=0;
a=[]
for i in range(N):
    a.append(list(map(int, input().split())))


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

    if s+C>0:
        k+=1

print(k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
A = []
for i in range(N):
    A.append(list(map(int, input().split())))

def main():
    cnt = 0
    for i in range(N):
        val = C
        for j in range(M):
            val += A[i][j] * B[j]
        if val > 0:
            cnt += 1
    return cnt

print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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()))
    addcnt = 0

    for j in range(m): 
        addcnt += b[j]*a[j]
    addcnt += c

    if addcnt >0:
        count += 1
 
print(count)

Submission status: Accepted

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()))
    num = 0
    for j in range(m):
        num += a[j]*b[j]
    num += c
    if num > 0:
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m,c=[int(i) for i in input().split(' ')]
B = [int(i) for i in input().split(' ')]
ans = 0
for _ in range(n):
  A = [int(i) for i in input().split(' ')]
  sum = c
  for i in range(m):
    sum += A[i] * B[i]
  ans += 1 if sum > 0 else 0
print(ans)

Submission status: Accepted

Solution code:
# B - Can you solve this?
# https://atcoder.jp/contests/abc121/tasks/abc121_b

N, M, C = map(int, raw_input().split())
B = list(map(int, raw_input().split()))

num_solve = 0
for _ in range(N):
    A = list(map(int, raw_input().split()))
    D = sum( a*b for (a,b) in zip(A, B)) + C
    if D > 0:
        num_solve += 1

print '{}'.format(num_solve)

Submission status: Accepted

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

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

    if test + C > 0:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
N,M,C= map(int,input().split())
B= list(map(int,input().split()))
A = [0]*N

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

Submission status: Accepted

Solution code:
import numpy as np

N, M, C = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]

array = []
for _ in range(N):
    row = [int(x) for x in input().split()]
    array.append(row)

A = np.array(array)
print(np.sum(A.dot(B) + C > 0))

Submission status: Accepted

Solution code:
N, M, C = map(int, raw_input().split())
B = map(int , raw_input().split())
ans = 0
for i in range(0, N):
    A = map(int , raw_input().split())
    tmp = [A[m] * B[m] for m in range(M)]

    if sum(tmp) + C > 0:
        ans+=1

print(ans)

Submission status: Accepted

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()))
  score = 0
  for i in range(m):
    x = a[i]
    score += x * b[i]
  score += c
  if score > 0:
    count += 1
print(count)

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

ans=0
K=[0]*M

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

print(ans)

Submission status: Accepted

Solution code:
import numpy as np
[N, M, C] = list(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: Accepted

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()))
    sum_value = [x*y for x, y in zip(A, B)]
    if (sum(sum_value)+C)>0:
        cnt += 1

print(cnt)

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

Solution code:
N,M,C=map(int,input().split())
stand=list(map(int,input().split()))
temp=[list(map(int,input().split())) for _ in range(N)]

res=0
for t in temp:
  ans=0
  for i in range(M):
    ans+=stand[i]*t[i]
  if ans+C>0:
    res+=1

print(res)

Submission status: Accepted

Solution code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
As = [list(map(int, input().split())) for _ in range(N)]

ans = 0

for A in As:
  score = 0
  for i in range(M):
    score += A[i]*B[i]
  if score + C > 0:
    ans += 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M, C = map(int, input().split())
A = []
cnt = 0
B = list(map(int, input().split()))

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

print(cnt)

Submission status: Accepted

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

for i in range(n):
    a.append(list(map(int, input().split())))

count = 0
for i in range(n):
    x = 0
    for j in range(m):
        x += a[i][j] * b[j]
    x += c

    if x > 0:
        count += 1
            
print(count)

Submission status: Accepted

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

cnt=0
for _ in range(N):
    A=[int(a) for a in input().split()]
    sum=0
    for j in range(M):
        sum+=A[j]*B[j]
    if sum+C > 0:
        cnt+=1

print(cnt)

Submission status: Accepted

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

a=[]
for i in range(N):
    a.append(list(map(int,input().split())))
cnt=0
for k in range(N):
    sum=0
    for j in range(M):
        sum+=a[k][j]*B[j]

    if sum+C > 0:
        cnt+=1

print(cnt)

Submission status: Accepted

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)]
ans=0
for i in range(n):
  code=0
  for j in range(m):
    code+=a[i][j]*b[j]
  if code+c>0:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
I=lambda:map(int,input().split());n,m,c=I();*b,=I()
print(sum(sum(a*b for a,b in zip(I(),b))+c>0for _ in[0]*n))

Submission status: Accepted

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

AC_codes = 0

for _ in range(N):
  A.append(list(map(int, input().split())))

for i in A:
  for j in range(len(B)):
    i[j] = i[j] * B[j]
  if sum(i) + C > 0:
    AC_codes += 1
print(AC_codes)

Submission status: Accepted

Solution code:
N,M,C = map(int,input().split())
deep  = list(map(int,input().split()))
score = 0
for n in range(1,N+1):
  blue = list(map(int,input().split()))
  linear = 0
  for m in range(1,M+1):
    linear += deep[m-1] * blue[m-1]
  if linear + C > 0:
    score += 1
print(score)

Submission status: Accepted

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()))
  ab = 0
  for i in range(len(a)):
    ab += a[i] * b[i]
  if ab > -c:
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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)]
count = 0
for i in range(n):
	total = 0
	for j in range(m):
		total += a[i][j] * b[j]
	total += c
	if total > 0:
		count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
N, M, C = map(int, input().split())
B = input().split()
sumN = 0
count = 0

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

print(count)

Submission status: Accepted

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

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

print(counter)

Submission status: Accepted

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)]
ans=0
for i in range(N):
    X=0
    for j in range(M):
        X+=(A[i][j]*B[j])
    X=X+C
    if  0 < X:
        ans = ans+1
print(ans)

Submission status: Accepted

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)]
ans=0
for i in range(N):
    X=0
    for j in range(M):
        X += A[i][j]*B[j]
    X += C
    if  0 < X:
        ans += 1
print(ans)

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

Solution code:
N,M,C = map(int,input().split())
b_list = [int(i) for i in input().split()]
right_answer = 0
for i in range(N):
  a_list = [int(j) for j in input().split()]
  sum = 0
  for k in range(M):
    sum =sum + a_list[k] * b_list[k]
  if sum+C > 0:
    right_answer +=1
print(right_answer)

Submission status: Accepted

Solution code:
#2019-04-09 2100 start

N,M,C= map(int, input().split())
B = input().split()
sumN = 0
count = 0

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


print(count)

Submission status: Accepted

Solution code:
#2019-04-09 2100 start

N,M,C= map(int, input().split())
B = input().split()
sumN = 0
count = 0

for i in range(N):
    A = input().split()
    for j in range(M):
        sumN = sumN + int(A[j])* int(B[j])
    if sumN + C > 0:
        count = count + 1
    elif sumN + C <= 0:
        count = count
    sumN = 0


print(count)

Submission status: Accepted

Solution code:
n,m,c=map(int,input().split())
b=[int(i) for i in input().split()]
mat=[]
for i in range(n):
    l=[int(i) for i in input().split()]
    mat.append(l)
cnt=0 
for i in range(n):
    sm=0
    for j in range(m):
        sm+=mat[i][j]*b[j]
    if sm+c>0:
        cnt+=1   
print(cnt)

Submission status: Accepted

Solution code:
import numpy as np

N, M, C  = tuple([int(x) for x in input().split(' ')])
B = np.array([int(x) for x in input().split(' ')])
A = np.array([[int(x) for x in input().split(' ')] for i in range(N)])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m, c = map(int,input().split())
bsrc = list(map(int,input().split()))
asrc = [list(map(int,input().split())) for _ in range(n)]
ans = 0
for a in asrc:
    tmp = c
    for i,j in zip(a,bsrc):
        tmp += i*j
    if tmp > 0:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
import numpy as np
n,m,c = list(map(int,input().split()))
b = tuple(map(int,input().split()))
array_b = np.array(b)
s = 0
for i in range(n):
  a = tuple(map(int,input().split()))
  array_a = np.array(a)
  t = array_a.T
  if np.dot(t,b) + c > 0:
    s += 1
  else:
    pass
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M,C=map(int,(input()).split())
List_B=[int(i) for i in (input()).split()]
t=0
for j in range(1,N+1):
  List_A=[int(k) for k in (input()).split()]
  if sum([x*y for (x,y) in zip(List_A,List_B)])>-C:
    t+=1
print(t)

Submission status: Accepted

Solution code:
from sys import stdin

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

print(ans)

Submission status: Accepted

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

count = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
for i in range(N):
  A_i = list(map(int, input().split()))
  if sum([x*y for (x,y) in zip(A_i,B)])+C > 0:
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
list1 = raw_input().split()
list_B = raw_input().split()

N = int(list1[0])

M = int(list1[1])

C = int(list1[2])

count = 0

for n in range(N):
    item = raw_input().split()
    total = 0

    for m in range(M):
        total += int(item[m]) * int(list_B[m])

    total += C
    if total > 0:
        count += 1

print int(count)

Submission status: Accepted

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

Submission status: Accepted

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

B = list(map(int, input().split()))
A = []
for _ in range(N):
    A_i = list(map(int, input().split()))
    A.append(A_i)
    
    
ans = 0
for A_i in A:
    cal = lambda x, y : x * y
    mul_ab = map(cal, A_i, B)
    sum_ab = sum(mul_ab)
    sum_c = sum_ab + C
    if sum_c > 0:
        ans += 1
print(ans)

Submission status: Accepted

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

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

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

result=0

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

result= 0

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

print(result)

Submission status: Accepted

Solution code:
N,M,C = map(int, input().split())
B = [int(_) for _ in input().split()]

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

print(count)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, M: int, C: int, B: "List[int]", A: "List[List[int]]"):
    c = 0
    for i in range(N):
        result = C
        for j in range(M):
            result += A[i][j]*B[j]
        if result > 0:
            c+=1
    print(c)
    return


# Generated by 1.1.3 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    B = [ int(next(tokens)) for _ in range(M) ]  # type: "List[int]"
    A = [ [ int(next(tokens)) for _ in range(M) ] for _ in range(N) ]  # type: "List[List[int]]"
    solve(N, M, C, B, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print cnt