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.

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

ans =0
for pa in A:
  x = sum(a*b for a,b in zip(pa, B)) + C
  ans += x > 0
print(ans)

Solution (Python):
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
A = []
for _ in range(N):
    A.append(list(map(int, input().split())))
count = 0
for so in A:
    total = 0
    for a, b in zip(so, B):
        total += a*b
    if total + C > 0:
        count += 1

print(count)

Solution (Python):
import numpy as np

N, M, C = map(int, input().split())
B = np.array([int(b) for b in input().split()])
As = np.array([[int(a) for a in input().split()] for _ in range(N)])

res = np.sum(As * B, axis=1) + C
l = len(np.where(res > 0)[0])

print(l)

Solution (Python):
import numpy as np
N,M,C = map(int, input().split())
B=np.array([int(n) for n in input().split()])
A=[]
for i in range(N):
    A.append([int(n) for n in input().split()])
A = np.array(A)
sum = 0
for i in range(N):
    if np.dot(A[i],B) + C >0:
        sum += 1
print(sum)

Solution (Python):
N,M,C = list(map(int, input().split(' ')))
B= list(map(int, input().split(' ')))
i=0
for j in range(N):
    ab=0
    A= list(map(int, input().split(' ')))
    for a, b in zip(A,B):
        ab+=a*b
    if ab+C>0:
        i+=1
print(i)

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

answer = 0

for i in range(N):
  A = [int(x) for x in input().split()]
  assert len(A) == len(B) == M
  if sum([a*b for a, b in zip(A, B)])+C > 0:
    answer += 1

print(answer)

Solution (Python):
N, M, C = [int(elem) for elem in input().split()]
B_list = [int(elem) for elem in input().split()]
A_mat = [[int(elem) for elem in input().split()] for _ in range(N)]
assert len(A_mat[0]) == M


num_correct_codes = 0
for A_list in A_mat:
    sum_ = C
    for A, B in zip(A_list, B_list):
        sum_ += A * B
    if sum_ > 0:
        num_correct_codes += 1

print(num_correct_codes)

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

cnt = 0
for _ in range(N):
    A = [int(s) for s in input().split()]

    r = 0
    for i in range(M):
        r += A[i] * B[i]
    r += C

    if r > 0:
        cnt += 1

print(cnt)

Solution (Python):


n,m,c=map(int,raw_input().split())
b=map(int,raw_input().split())
a=[]
for i in xrange(n):
 a.append(map(int,raw_input().split()))
res=0
for i in xrange(n):
 temp=0
 for j in xrange(m):
  temp+=a[i][j]*b[j]
 if temp+c>0:
  res+=1
print res

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

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

print(ret)

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

for i in range(n):
    problems.append(list(map(int,input().split())))
    
for problem in problems:
    judge = 0
    for i in range(len(problem)):
        judge += problem[i]*b[i]
    if judge + c > 0:
        counter+= 1
        
print(counter)

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

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

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

Solution (Python):
import numpy as np

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()))
    if np.dot(A,B)+C > 0:
        cnt += 1

print(cnt)

Solution (Python):
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()))
	temp = 0
	for j in range(m):
		temp += A[j]*B[j]
		
	if(temp + c > 0):
		ans += 1

print(ans)

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

Solution (Python):
from operator import mul
from functools import reduce

n, m, c = list(map(int, input().split(" ")))
bs = list(map(int, input().split(" ")))
a_nm = []
for _ in range(n):
    a_m = list(map(int, input().split(" ")))
    a_nm.append(a_m)

ans = 0
tested = [sum([a * b for a, b in zip(a_nm[i], bs)]) + c for i in range(n)]
passed = list(filter(lambda x: x > 0, tested))
print(len(passed))

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

Solution (Python):
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 = C
    for i, j in zip(A, B):
        tmp += i * j
    if tmp > 0:
        ans += 1
print(ans)

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

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

print(cnt)

Solution (Python):
import numpy as np

if __name__ == '__main__':
    N, M, C = map(int, input().split())
    B = np.array(list(map(int, input().split())))
    A = np.array(list(map(lambda _: list(map(int, input().split())), range(N))))

    scores = A.dot(B)
    print(np.sum(scores > -C))

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

Solution (Python):
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())))

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

Solution (Python):
N,M,C=map(int,input().split())
base=list(input().split())
base=[int(s) for s in base]
kekka=[]
for i in range(N):
    a=list(input().split())
    a=[int(s) for s in a]
    kekka.append(a)
count=0



for i in range(N):
    summ=C
    for j in range(M):
        summ+=base[j]*kekka[i][j]
    if summ>0:
        
        count+=1
print(count)

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

Solution (Python):
N,M,C = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
cnt=0
for i in range(N):
    x=0
    for num,a in enumerate(input().split()):
        x+=B[num]*int(a)
    if(x>(-1)*C):
        cnt+=1
print(cnt)

Solution (Python):
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())))

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

print(ans)

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

right = 0

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

print(right)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[]
d=0
count=0
for i in range(0,n):
    a.append(input().split())

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

print(count)

Solution (Python):
I=lambda:map(int,input().split());n,m,c=I();*b,=I();print(eval('+(-c<sum(x*y for x,y in zip(I(),b)))'*n))

Solution (Python):
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())))

right = 0

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

print(right)

Solution (Python):
N,M,C = map(int,input().split())
weight = list(map(int,input().split()))
ans = 0
for i in range(N):
  feature = list(map(int,input().split()))
  feature = [f*w for f,w in zip(feature,weight)]
  if (sum(feature) + C) > 0:
    ans += 1
print(ans)

Solution (Python):
N,M,C = (int(i) for i in input().split())
B = list(int(i) for i in input().split())
cnt = 0

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

Solution (Python):
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)]

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

Solution (Python):
n,m,c = (int(i) for i in input().split())
b = list(int(i) for i in input().split())
ct = 0

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

Solution (Python):
n, m, c = map(int, input().split())
b = input().split()
cnt = 0

for i in range(n):
  a = input().split()
  sum = 0
  for ai, bi in zip(a, b):
    sum += int(ai)*int(bi)
  if sum + c > 0:
    cnt += 1

print(cnt)

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

print(ans)

Solution (Python):
def compute(a, b, c):
    val = c
    for i in range(len(a)):
        val += a[i]*b[i]
    return val

n,m,c=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
count=0
for i in range(n):
    a=[int(x) for x in input().split()]
    if compute(a,b,c)>0:
        count = count + 1
print(count)

Solution (Python):
n, m, c = list(map(int, input().split()))
Bs = list(map(int, input().split()))
As = [list(map(int, input().split())) for i in range(n)]

counter = 0
for i in range(n):
    x = 0
    for j in range(m):
        x += As[i][j] * Bs[j]
    x += c
    if x > 0:
        counter += 1
print(counter)

Solution (Python):
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 i in range(N):
    s = 0
    for j in range(M):
        s += a[i][j] * b[j]
    s += C
    if s > 0:
        cnt += 1
print(cnt)

Solution (Python):

N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
ans = sum(sum(a * b for a, b in zip(A[i], B)) + C > 0 for i in range(N))
print(ans)

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

print(sum)

Solution (Python):
n, m, c = map(int, input().split())
B = list(map(int, input().split()))
ans = 0
for _ in range(n):
    ret = 0
    for a, b in zip(map(int, input().split()), B):
        ret += a * b
    if ret + c > 0:
        ans += 1
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
Blist = list(map(int,input().split()))
Alist = [list(map(int,input().split())) for i in range(N)]

counter = 0

for x in range(N):
    all = C
    xlist = Alist[x]
    for j in range(M):
        all += Blist[j]*xlist[j]
    if all>0:
        counter += 1

print(counter)

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

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

Solution (Python):
import sys

def parse(inp):
    n,m,c=map(int,next(inp).split())
    B=list(map(int,next(inp).split()))
    A=[[] for _ in range(n)]
    
    for i in range(n):
        A[i]=list(map(int,next(inp).split()))
        
    return n,m,c,A,B
  
def main(inp):
    n,m,c,A,B=inp
    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
            
    return ans
  
print(main(parse(sys.stdin)))

Solution (Python):

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

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

Solution (Python):
n, _, c = map(int, input().split())
bs = tuple(map(int, input().split()))

count = 0
for _ in range(n):
    if sum(x * bs[i] for i, x in enumerate(map(int, input().split()))) + c > 0:
        count += 1

print(count)

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

B = [int(item) for item in input().split()]
A = [[int(item) for item in input().split()] for i in range(N)]

correct = 0

for a in A:
  ok = 0
  for item_a, item_b in zip(a, B):
    ok += item_a * item_b
  ok += C
  if ok > 0:
    correct += 1
    
print(correct)

Solution (Python):
N, M, C = map(int, input().split())
a = []
for i in range(N+1):
    a.append(list(map(int, input().split())))

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

print(count)

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

res = 0

for A in _input:
    cal = 0
    for a,b in zip(A,B):
        cal += a * b
    if cal + C > 0:
        res += 1

print(res)

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

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

out_num=0

for n in range(N):
  A=[int(x) for x in input().split()]
  a=[A[i]*B[i] for i in range(M)]
  check=sum(a)+C
  if check>0:
    out_num+=1
    
print(out_num)

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

Solution (Python):
import numpy as np

N, M, C = map(int, input().split())
B = np.array([int(i) for i in input().split()])
inputs = [
    sum(np.array([int(i) for i in input().split()]) * B) + C for _ in range(N)
]

print(sum([1 if inputs[i] > 0 else 0 for i in range(N)]))

Solution (Python):
import numpy as np

N, M, C = map(int, input().split())
B = np.array([int(i) for i in input().split()])
inputs = [
    np.array([int(i) for i in input().split()]) * B for _ in range(N)
]

ans = 0
for i in range(N):
    if C + sum(inputs[i]) > 0:
        ans += 1

print(ans)

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

ans = 0
for i in range(N):
    if C + sum([a * b for a, b in zip(inputs[i], B)]) > 0:
        ans += 1

print(ans)

Solution (Python):
m = list(map(int,input().split()))
b = list(map(int,input().split()))
n=0
for k in range(m[0]):
  acc = 0
  for z,k in zip(list(map(int,input().split())), b):
    acc += z*k
  if acc + m[2] > 0:
    n += 1
print(n)

Solution (Python):
def judge(A, B, C, M):
	result = C
	for i in range(M):
		result += A[i] * B[i]

	return result > 0

def main():
	N, M, C = map(int, input().split())
	B = [int(x) for x in input().split()]
	count = 0

	for i in range(N):
		A = [int(x) for x in input().split()]

		if judge(A, B, C, M):
			count += 1

	print(count)



if __name__ == '__main__':
	main()

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

Solution (Python):
import numpy as np


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

B = list(map(int, input().split()))
A = [None] * N

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

A = np.array(A)
B = np.array(B)

print(len([i for i in (np.sum(A * B, axis=1) + C).tolist() if i > 0]))

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

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

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

Solution (Python):
N, M, C = map(int, input().split())
A = [list(map(int, input().split())) for i in range(N+1)]
cnt = 0
for i in range(1, N+1):
    sums = 0
    for p in range(M):
        sums += A[i][p]*A[0][p]
    if sums > -C:
        cnt += 1
print(cnt)

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

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

print(count)

Solution (Python):
A = []

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

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

for i in range(N):
    A_before = input().split()
    A.append([int(x) for x in A_before])

count = 0

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

Solution (Python):
import sys
input = sys.stdin.readline

N,M,C = map(int,input().split())
Bm = list(map(int,input().split()))
rtn=0
for i in range(N):
  Aim = list(map(int,input().split()))
  chk = C
  for j in range(M):
    chk += Aim[j]*Bm[j]
  if chk > 0:
    rtn+=1
print(rtn)

Solution (Python):


import sys 


N,M,C = map(int, input().split())
Bn = list(map(int, input().split()))
ans = 0
for _ in range(N):
  an = list(map(int, input().split()))
  s = C
  for i in range(len(an)):
    s += an[i] * Bn[i]
  if s > 0:
    ans += 1

print(ans)

Solution (Python):
import numpy as np
N, M, C = (int(i) for i in input().split())
B = np.array([list(map(int, input().split()))])
A = np.array([list(map(int, input().split())) for _ in range(N)])
print(np.sum(np.sum(A*B, axis=1)+C >=1))

Solution (Python):
import numpy as np
N, M, C = (int(i) for i in input().split())
B = [list(map(int, input().split()))]
AB = np.array([list(map(int, input().split())) for _ in range(N)])
aa = np.sum((B* AB), axis=1)
print(np.sum((aa+C) >= 1))

Solution (Python):
N, M, C = map(int, input().split())
lst1 = [int(x) for x in input().split()]
ret = 0
for x in range(N):
    lst2 = [int(y) for y in input().split()]
    if (sum([x * y for x, y in zip(lst1, lst2)]) + C) > 0:
        ret += 1
print(ret)

Solution (Python):
N, M, C = map(int, input().split())
B = [int(i) for i in input().split()]
As = []
for i in range(N):
	As.append([int(j) for j in input().split()])
cnt = 0
for item in As:
	res = 0
	for idx, elem in enumerate(item):
		res += elem * B[idx]
	res += C
	if res > 0:
		cnt += 1
print(cnt)

Solution (Python):
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) :
    calc = C
    for j in range(M) :
        a,b = A[i][j],B[j]
        calc += a*b
    if calc > 0 :
        ans += 1
print(ans)

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

Solution (Python):

import sys


def solve(N: int, M: int, C: int, B: "List[int]", A: "List[List[int]]"):
    import numpy as np
    print(np.sum(np.dot(A, B) > -C))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    M = int(next(tokens))  
    C = int(next(tokens))  
    B = [int(next(tokens)) for _ in range(M)]  
    A = [[int(next(tokens)) for _ in range(M)]
         for _ in range(N)]  
    solve(N, M, C, B, A)


if __name__ == '__main__':
    main()

Solution (Python):

import sys


def solve(N: int, M: int, C: int, B: "List[int]", A: "List[List[int]]"):
    import numpy as np
    print(np.sum(np.dot(A, B) > -C))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    M = int(next(tokens))  
    C = int(next(tokens))  
    B = [int(next(tokens)) for _ in range(M)]  
    A = [[int(next(tokens)) for _ in range(M)]
         for _ in range(N)]  
    solve(N, M, C, B, A)


if __name__ == '__main__':
    main()

Solution (Python):
n,m,c,*a=map(int,open(0).read().split());print(sum(sum(a[:m][t]*a[s+t]for t in range(m))+c>0for s in range(m,(n+1)*m,m)))

Solution (Python):
N, M, C  = map(int, raw_input().split())
B_source = map(int, raw_input().split())

A_sources = []
for A_input in range(N):
  A_sources.append(map(int, raw_input().split()))

ok_source_count = 0
for i in range(N):
  i_results = []
  for j in range(M):
    i_results.append(A_sources[i][j] * B_source[j])

  check_value = sum(i_results, C)
  if check_value > 0:
    ok_source_count = ok_source_count + 1

print(ok_source_count)

Solution (Python):
def main():
    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]
        tmp += c
        if tmp > 0:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
N, M, C = map(int, input().split())
b = list(map(int, input().split()))
l=[]
k,s=0,0
for i in range(N):
    l.append([int(j) for j in input().split()])
    
for i in range(N):
    for j in range(M):
        s+=l[i][j]*b[j]
    if s+C>0:
        k+=1
    s=0

print(k)

Solution (Python):

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

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

Solution (Python):
import sys
import numpy as np
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
b = np.array(b)
a= [list(map(int, l.split())) for l in sys.stdin]
a = np.array(a)
counter = 0
for i in range(n):
    if np.dot(a[i],b.T).sum() > -c:
        counter += 1
print(counter)

Solution (Python):
import numpy as p;i=lambda:p.array(input().split(),dtype='i8');n,m,c=i();b=i()
print(sum(-c<p.dot(b,i())for _ in [0]*n))

Solution (Python):
def int_raw():
    return int(raw_input())

def ss_raw():
    return raw_input().split()

def ints_raw():
    return map(int,ss_raw())

N,M,C = ints_raw()
Bs = ints_raw()
ans = 0
for n_i in xrange(N):
    As = ints_raw()
    val = sum(map(lambda i: As[i]*Bs[i],range(M)))+C
    
    if val > 0:
        ans = ans +1
print ans

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

Solution (Python):
n,m,c,*b=map(int,open(0).read().split())
print(sum(-c<sum(x*y for x,y in zip(b[:m],b[m*i:m+m*i]))for i in range(1,n+1)))

Solution (Python):
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 aa in a:
  if sum(x * y for x, y in zip(aa, b)) + c > 0:
    ans += 1
print(ans)

Solution (Python):
def main():
    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()))
        tmp = C
        for i in range(M):
            tmp += A[i] * B[i]
        if tmp > 0:
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
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()))
  if sum([a*b for a,b in zip(A,B)]) + c > 0:
    ans += 1
print(ans)

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

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

result = 0
for k in range(n):
  a = list(map(int, input().split()))
  
  f = c
  for i, v in enumerate(a):
    f += v * b[i]
  
  if f > 0:
    result += 1
    
print(result)

Solution (Python):
import sys
import numpy as np

size_data = sys.stdin.readline().strip().split(" ")

N = int(size_data[0])
M = int(size_data[1])
C = int(size_data[2])

column_vector = np.append(np.array(sys.stdin.readline().strip().split(" "), dtype=np.int64), [C])
a_matrix = []

for i in range(N):
    a_row = np.append(np.array(sys.stdin.readline().strip().split(" "), dtype=np.int64), [1])
    a_matrix.append(a_row)


a_matrix = np.array(a_matrix)
values = np.dot(a_matrix, column_vector)
results = np.where(values > 0)
result = len(results[0])

print(result)

Solution (Python):
a, b, c = [int(x) for x in input().split()]
d = [int(x) for x in input().split()]
e = [[int(x) for x in input().split()] for i in range(a)]
r = 0
for i in range(a):
    t =  sum([x * d[idx] for idx, x in enumerate(e[i])])
    if t+c > 0:
        r += 1
print(r)

Solution (Python):
N, M, C = map(int, input().split())
*B, = map(int, input().split())
ans = 0
for i in range(N):
    *A, = map(int, input().split())
    ans += sum(a*b for a, b in zip(A, B)) + C > 0
print(ans)

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

cnt = 0

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

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

Solution (Python):
import numpy as np

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

num = 0
for a in A:
  if sum(a * B) + C > 0:
    num += 1

print(num)

Solution (Python):
N, M, C = [int(_) for _ in input().split()]
B = [int(_) for _ in input().split()]
A = [[int(_) for _ in input().split()] for i in range(N)]

result = sum(
    C + sum([x * y for x, y in zip(a, B)]) > 0
    for a in A
)

print(result)

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

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

Solution (Python):
N, M, C = map(int, input().split())
b = [int(i) for i in input().split()]
a = []
for i in range(N):
    a.append([int(i) for i in input().split()])

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

print(count)

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

Solution (Python):

n, m, c = map(int, input().split())
bm = list(map(int, input().split()))
data = [list(map(int, input().split())) for j in range(n)]
ac = 0
total = 0
for i in range(n):
    for k in range(m):
        total += data[i][k] * bm[k]
    total += c
    if total > 0:
        ac += 1
    total = 0
print(ac)

Solution (Python):
s=input().split()
n=int(s[0]);m=int(s[1]);c=int(s[2])
b=input().split();a=[];ans=0
for i in range(n) : a.append(input().split())
for i in range(n) :
  temp=0
  for j in range(m) : temp+=int(a[i][j])*int(b[j])
  if temp+c>0 : ans+=1
print(ans)