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

Submission status: Accepted

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

ans = 0
for i in range(N):
    count = 0
    for j in range(M):
        count += source_code[i][j] * B[j]

    if count + 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 = [list(map(int,input().split())) for _ in range(N)]

ans = 0
for row in range(N):
    tmp = C
    for col in range(M):
        tmp += A[row][col]*B[col]
    if tmp > 0:
        ans += 1

print(ans)

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

Submission status: Accepted

Solution code:
def dot(A, B):
    ret = 0
    if len(A)==len(B):
        for a, b in zip(A, B):
            ret += a*b
    return ret
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 a in A:
    if dot(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()))
ans=0
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:
import numpy as np
n, m, c = list(map(int, input().split()))
b = np.array(list(map(int, input().split())))
count = 0
for i in range(n):
    a = np.array(list(map(int, input().split())))
    result = sum(a*b) + c
    if result > 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
import numpy as np

n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [0]*n
for i in range(n):
    a[i] = list(map(int, input().split()))

ans = 0
for i in range(n):
    if np.dot(np.array(a[i]), np.array(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):
  sum = c
  L = list(map(int, input().split()))
  for k in range(m):
    sum += B[k]*L[k]
  if sum > 0:
    cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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 np.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()))
A=[list(map(int,input().split())) for i in range(N)]
ret=0
for i in range(N):
  ans=C
  for j in range(M):
    ans+=B[j]*A[i][j]
  if ans >0:
    ret+=1
print(ret)

Submission status: Accepted

Solution code:
N, M, C = (int(x) for x in input().split())
B = [int(x) for x in input().split()]
A = []
for _ in range(N):
    A.append([int(x) for x in input().split()])
ans, s = 0, 0
for Ai in A:
    for i in range(M):
        s += Ai[i] * B[i]
    if s + C > 0: ans += 1
    s = 0
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]
  if sum>-c:
    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=list(map(int,input().split()))
    a.append(A)
z=c
ans=0
for i in range(n):
    for x,y in zip(b,a[i]):
        z+=x*y
    if z>0:
        ans+=1
        z=c
    else:
        z=c
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=list(map(int,input().split()))
    A.append(a)
    
X=0
V=0
for i in range(N):
    for j in range(M):
        X+=A[i][j]*B[j]
    X+=C
    if X>0:
        V+=1
    X=0
print(V)

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import pdb
from bisect import *
from collections import *
from copy import deepcopy
from datetime import *
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

def main():
    """ main """
    N,M,C = map(int, input().split())
    BS = list(map(int, input().split()))
    ans = 0
    for _ in range(N):
        AS = list(map(int, input().split()))
        total = C
        for i in range(M):
            total += AS[i]*BS[i]
        if total > 0: ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#2019/09/30
(N, M, C), B, *A = [list(map(int, i.split())) for i in open(0)]
#print(N, M, C)
#print(B)
#print(A)
src = list([[i*j for i,j in zip(a, B)] for a in A])
#( )で囲むとジェネレータになる
#参照：https://rennnosukesann.hatenablog.com/entry/2017/03/17/163959
#src = list(([i*j for i,j in zip(a, B)) for a in A])
#print(src)
cnt = 0
for i in src:
    if (sum(i) + C) > 0:
#        print(sum(i), i)
        cnt += 1
print(cnt)

#別解
'''
cnt = 0
for a in A:
    ans = 0
    for i,j in zip(a, B):
        ans += i*j
    if (ans + C) > 0:
        cnt += 1
print(cnt)
'''

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    n, m, c = map(int, input().split())
    b = list(map(int, input().split()))
    print(
        sum(
            [
                sum([b[i] * j for i, j in enumerate(map(int, input().split()))]) + c > 0
                for _ in range(n)
            ]
        )
    )


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n, m, c = list(map(int, input().rstrip('\n').split()))
    b = list(map(int, input().rstrip('\n').split()))
    cnt = 0
    for _ in range(n):
        a = list(map(int, input().rstrip('\n').split()))
        t = c
        for i in range(m):
            t += (a[i] * b[i])
        if t > 0:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
N, M, K =map(int,input().split())
bases = 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+= bases[j]*a[j]
  
  if tmp+K>0:
    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 _ in range(N)]
t = 0
for s in A:
    if sum([s[i]*B[i] for i in range(M)]) +C > 0:
        t += 1
print(t)

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

Submission status: Accepted

Solution code:
n,m,c = map(int, input().split())
b_lst = list(map(int, input().split()))
ans = 0
for i in range(n):
    a_lst = list(map(int, input().split()))
    ttl = c
    for a,b in zip(a_lst,b_lst):
        ttl+=a*b
    if ttl > 0:
        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
ans = 0
for i in range(n):
    for j in range(m):
        cnt += a[i][j]*b[j]
    cnt += c
    if cnt > 0:
        ans += 1
    cnt = 0
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


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

    print(ans)    
    

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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())))

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

ans=0
for i in range(N):
    if sum(A[i])>-C:
        ans+=1
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.append(list(map(int,input().split())))
ans=0
for i in a:
  if sum([x*y for (x,y) in zip(i,b)])>-c:
    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 _ in range(n)]
result = 0
for i in range(n):
    counter = c
    for s in range(m):
        counter += a[i][s]*b[s]
    if counter > 0:
        result += 1
print(result)

Submission status: Accepted

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

n, m, c = map(int, raw_input().split())

b = map(int, raw_input().split())

a = []

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

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

print ans

Submission status: Accepted

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: 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)]
kosuu=0

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

Submission status: Accepted

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

def mul(x, y):
  ret = 0
  for i in range(len(x)):
    ret += x[i]*y[i]
  return ret
    
ans = 0
for i in range(n):
  a = list(map(int, input().split()))
  if mul(a, b) + c > 0:
    ans += 1

print(ans)

Submission status: Accepted

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

a_np = np.array(a)
b_np = np.array(b)

a_b = a_np * b_np 
a_b = np.sum(a_b,axis = 1) + c

count = 0
for i in range(n):
  if a_b[i] > 0:
    count += 1
print(count)

Submission status: Accepted

Solution code:
#coding:utf-8
import numpy as np
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 item in a:
    #A*Bについて、今回は行列の積を求めているのと同じ
    if np.dot(item, b) + 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()))
a = [list(map(int, input().split())) for i in range(n)]

count = 0

for i in range(0, n):
    #n行ごとに答えを計算する。最初はcで初期化
    ans = c
    for j in range(0, m):
        ans += a[i][j] * b[j]
        #m列目になったら判定実施
        if j == m-1 and ans > 0:
            count += 1

print(count)

Submission status: Accepted

Solution code:
n, m, c = map(int, input().split())
b = [int(i) for i in input().split()]
a = [[int(j) for j in input().split()] for _ in range(n)]
ans = 0
for k in range(n):
    ct = c
    for l in range(m):
        ct += a[k][l] * b[l]
    if ct > 0:
        ans += 1
    ct = 0
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()))
    total=0
    for j in range(M):
        a=A[j]*B[j]
        total +=a
    ans=total+C
    if ans > 0:
        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())))
A = np.array([list(map(int, input().split())) for _ in range(N)])

cnt = 0

for i in range(N):
    if np.dot(A[i], B) > -C:
        cnt += 1



print(cnt)

Submission status: Accepted

Solution code:
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)]
ans=0
for i in range(N):
    if sum(np.array(A[i])*np.array(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()))
A = [list(map(int, input().split())) for _ in range(N)]

cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
n,m,c = map(int ,input().split())
l=[list(map(int ,input().split())) for x in range(n+1)]
cont=0
for i in range(n):
    k=0
    for h in range(m):
        k+=l[0][h]*l[i+1][h]
    k=k+c
    if k>0:
        cont+=1
print(cont)

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)]

cnt = 0
for i in range(N):
    tmp = 0
    for j in range(M):
        tmp += A[i][j] * B[j]
    if tmp + 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 _ in range(n)]

ans =0
def main(x,y,z,c):
    p =0
    for i in range(z):
        p +=x[i]*y[i]
    return p + c

for i in range(n):
    #print(main(a[i],b,m,c))
    if main(a[i],b,m,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 = [list(map(int, input().split())) for _ in range(n)]

ans = 0
for i in range(n):
    if sum(map(lambda x, y: x * y, a[i], b)) + c > 0:
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    (N,M,C)=(int(i) for i in input().split())
    B=[int(i) for i in input().split()]
    A=[[int(j) for j in input().split()] for i in range(N)]
    count=0
    for sc in A:
        count += 1 if sum([sc[i]*B[i] for i in range(M)])+C>0 else 0
    print(count)
if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
n,m,c = map(int,input().split())
b_li = list(map(int, input().split()))
a_li = [list(map(int,input().split())) for _ in range(n)]
count = 0
for each in a_li:
    su = c
    for a,b in zip(each,b_li):
        su += a*b
    if su > 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 _ 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)

Submission status: Accepted

Solution code:
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 j in range(n)]
cnt = 0
for i in range(n):
  if sum(a[i][j] * b[j] for j in range(m)) + 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 = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n):
    s = c
    for j, k in zip(a[i], b):
        s += j * k
    if s > 0:
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

num = 0

for _ in range(n):
    A = list(map(int, input().split()))
    ans = [a*b for (a, b) in zip(A, B)]
    if sum(ans)+c > 0:
        num += 1

print(num)

Submission status: Accepted

Solution code:
import numpy as np

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

b_list = np.array(list(map(int, input().split())))

counter = 0

for _ in range(n):
  a_list = np.array(list(map(int, input().split())))
  if np.dot(a_list, b_list) + c > 0: counter += 1 
    
print(counter)

Submission status: Accepted

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 np.sum(A*B) + C > 0:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
N,M,C=map(int,input().split())
lst=[[0,0,0] for _ in range(N)]
B=list(map(int,input().split()))
ans=0
for i in range(N):
  lst[i]=list(map(int,input().split()))
  v=0
  for j in range(M):
    v+=B[j]*lst[i][j]
  if v+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()))
  p=C
  for j in range(M):p+=A[j]*B[j]
  if p>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 _ in range(n):
  now = c
  tmp = list(map(int,input().split()))
  for i in range(m):
    now += b[i] * tmp[i]
  if now > 0:
    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 _ in range(n)]
answer = 0

for ai in a:
    if sum(am * bm for am, bm in zip(ai, b)) > -c:
        answer += 1
print(answer)

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

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):
    s = 0
    a = list(map(int, input().split()))
    for j in range(m):
        s += a[j] * b[j]
    if s + 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 '0'*N:
    A = list(map(int, input().split()))
    res = sum(map(lambda ar:ar[0]*ar[1], zip(B,A))) + C
    c = c + 1 if res > 0 else c
print(c)

Submission status: Accepted

Solution code:
def main():

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N,M,c=map(int,input().split())
B = list(map(int,input().split()))
count=0
for n in range(N):
    A=list(map(int,input().split()))
    d=0
    for m in range(M):
        d+=A[m]*B[m]
    if d+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)]

res = 0

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

print(res)

Submission status: Accepted

Solution code:
import numpy as np

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

counter=0
for i in range(N):
  if np.dot(A[i, :], 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()))
cnt = 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: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)]
cnt=0
for i in range(n):
    x=0
    for j in range(m):
        x+=a[i][j]*b[j]
    if x+c>0:
        cnt+=1
print(cnt)

Submission status: Accepted

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

print(sum([1 if sum(t[0]*t[1] for t in zip(alist[i], blist)) + C > 0 else 0 for i in range(N)]))

Submission status: Accepted

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

res = 0
for i in range(N):
    sum = 0
    for j in range(M):
        sum += alist[i][j] * blist[j]
    if sum + C > 0:
        res += 1
print(res)

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 i in range(n):
  ab = np.array([list(map(int, input().split()))])
  if int(np.dot(ab, B.T)) + 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 _ in range(N)]

cnt = 0

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

    if result > 0:
        cnt += 1

print(cnt)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
g,r,c=map(int,input().split())
b=list(map(int,input().split()))
ans=0
for _ in range(g):
  f=c
  hj=list(map(int,input().split()))
  for z,x in zip(b,hj):
    f+=z*x
  if f>0:ans+=1
print(ans)

Submission status: Accepted

Solution code:
def dot(x,y):
    cnt = 0
    for i in range(M):
        cnt += x[i]*y[i]
    return cnt
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
cor = 0
for _ in range(N):
    A = list(map(int,input().split()))
    if dot(A,B)+C>0:
        cor += 1
print(cor)

Submission status: Accepted

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

for i in range(N):
    List=[]
    for j in range (M):
        
        List.append(List_A[i][j]*List_B[j])
    if sum(List)+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 _ in range(N)]

ans = 0

for i in range(N):
    num = C
    for j in range(M):
        num += A[i][j] * B[j]
    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()))

cnt = 0
for _ in range(n):
    A = list(map(int, input().split()))

    total = 0
    for a, b in zip(A, B):
        total += a * b
    total += c

    if total > 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 _ in range(n):
	a=list(map(int,input().split()))
	if sum(a[i]*b[i] for i in range(m))+c>0: ans+=1
print(ans)

Submission status: Accepted

Solution code:
A = 0
N, M, C = map(int, input().split())
listB = list(map(int, input().split()))
for i in range(N):
    listA = list(map(int, input().split()))
    x = [b * a for (b, a) in zip(listA, listB)]
    if sum(x) + C > 0:
        A += 1
print(A)

Submission status: Accepted

Solution code:
n, m, c = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0
for _ in range(n):
    A = list(map(int, input().split()))
    if sum(a*b for a,b in zip(A,B)) + c > 0:
      cnt += 1

print(cnt)

Submission status: Accepted

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

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())))

#print(a)

count = 0
for i in range(n):
    sum = 0
    for j in range(m):
        sum += a[i][j]*b[j]
#    print("sum: "+str(sum))
    if sum + c > 0:
        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())))
A = np.empty([N, M], dtype = int)
for n in range(N):
    A[n] = np.array(list(map(int, input().split())))

print ((((A * B).sum(1) + C) > 0).sum())

Submission status: Accepted

Solution code:
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 _ in range(n)]

ans = 0
for i in a:
    judge = sum([k*v for k,v in zip(i,b)]) + c
    if judge > 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())))

ans=0
for i in range(n):
    accept=0
    for _m in range(m):
        accept+=a[i][_m]*b[_m]

    if accept+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 _ in range(n):
  a = map(int, input().split())
  d = 0
  for i, j in zip(a, b):
    d += i * j
  if d + 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 _ in range(n):
    a=list(map(int,input().split()))
    if sum(a[i]*b[i] for i in range(m))+c>0: ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
cnt=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:
		cnt+=1
	ans=0
	
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):
  temp=0
  A=list(map(int,input().split()))
  for a,b in zip(A,B):
    temp+=a*b
  if temp+c>0:
    ans+=1
print(ans)