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

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

Submission status: Accepted

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

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

    num_list = []
    for _ in range(n):
        num_list.append(list(map(int,input().split())))

    count = 0

    for i in range(n):
        tmp = 0
        for j in range(m):
            tmp += num_list[i][j] * b_list[j]
        if tmp + c > 0:
            count += 1

    print(count)

if __name__ == '__main__':
    main()

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()))
    ttl = 0
    for k in range(m):
        ttl += b[k]*a[k]
    if ttl +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=[None]*N
for i in range(N):
    A[i]=list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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

    for n in range(N):
        result = 0
        for m in range(M):
            result += B[m] * A[n][m]
        count += 1 if result + C > 0 else 0
    print(count)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N,B,C = map(int,input().split())
b = list(map(int,input().split()))
cnt = 0;
for i in range(N):
    g = 0;
    a = list(map(int,input().split()))
    for j in range(B):
        g+=a[j]*b[j]
    if g+C>0: cnt+=1;
print(cnt)

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = 0
for am in AM:
    chk = 0
    for i in range(M):
        chk += am[i] * B[i]
    if chk + 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:
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()))
    check = C

    for i,j in zip(A,B):
        check = check + (i*j)

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

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):
    tmp = [int(x) for x in input().split()]
    a.append(tmp)

cnt = 0
for i in range(n):
    tmplst = [a[i][x] * b[x] for x in range(m)]
    if sum(tmplst) + 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 = s = 0
for i in range(n):
    s=0
    for j in range(m):
        s += a[i][j] * b[j] 
    if s + 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()))
  total = c 
  for j in range(len(b)):
    total += a[j] * b[j]

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

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

n, m, c = na()
b = na()
a = nan(n)

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

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

Submission status: Accepted

Solution code:
n,m,c = map(int,input().split())
b_li = list(map(int,input().split()))
ans = 0
for i in range(n):
  a_li = list(map(int,input().split()))
  check = 0
  for k in range(m):
    check += a_li[k]*b_li[k]
  if check+c>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())))
A = []
count = 0
for i in range(N):
  a = np.array(list(map(int, input().split())))
  if np.sum(a * B) + C > 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()))
B=np.array(B)
L=[list(map(int,input().split())) for _ in range(N)]
L=np.array(L)
ans=0
for i in range(N):
    if B.dot(L[i])+C>0:
        ans+=1
print(ans)

Submission status: Accepted

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

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

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:
import numpy as np
n, m, c = map(int, input().split())
b = np.array(tuple(map(int, input().split())))
ans = 0
for i in range(n):
    a = np.array(tuple(map(int, input().split())))
    if np.dot(a, b) + c > 0:
        ans += 1

print(ans)

Submission status: Accepted

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

b = np.array(b)
ans = 0
for i in range(n):
    ch = 0
    t_a = np.array(a[i])
    if sum(t_a*b) + c > 0:
        ans += 1

print(ans)

Submission status: Accepted

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

a=[]
b=[]
b = list(map(int, input().split()))

for _ in range(n):
    a.append(list(map(int, input().split())))
    
ans=0
for i in range(n):
    s=0
    for j, k in zip(a[i],b):
        s += j*k
    if s + c > 0:
        ans+=1

print(ans)

Submission status: Accepted

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

a = []
for i in range(n):
    a.append([int(x) for x in input().split()])

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

print(ans)

Submission status: Accepted

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

cnt = 0
for _ in range(N):
    ans = 0
    Az = [int(i) for i in input().split()]
    for idx in range(M):
        ans += Az[idx] * Bz[idx]
    if ans + C > 0:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
import numpy as np
n,m,c=map(int,input().split())
*b,=map(int,input().split())
b=np.array(b)
a=[]
for i in range(n):
    *x,=map(int,input().split())
    a.append(x)
    
a=np.array(a)
cnt=0
for i in range(n):
    if np.sum(a[i]*b)+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()))
    k=0
    for i in range(m):
        k+=a[i]*b[i]
    ans+=(k+c>0)
print(ans)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    N, _, C = map(int, input().split())
    B = tuple(map(int, input().split()))

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import numpy as np
def input(): return sys.stdin.readline().rstrip()

def main():
    N, _, C = map(int, input().split())
    B = tuple(map(int, input().split()))

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import numpy as np
def input(): return sys.stdin.readline().rstrip()

def main():
    N, _, C = map(int, input().split())
    B = np.array(tuple(map(int, input().split())))
    A = [np.array(tuple(map(int, input().split()))) for _ in range(N)]

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

if __name__ == '__main__':
    main()

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

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

	s += c
	if s > 0:
		o += 1
	s = 0

print(o)

Submission status: Accepted

Solution code:
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))

sys.setrecursionlimit(10 ** 9)


def main():
    N, M, C = MAP()
    B = LIST()
    A = [LIST() for _ in range(N)]

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

    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m, c = map(int, input().split())
bl = list(map(int, input().split()))
al = [list(map(int, input().split())) for _ in range(n)]

count = 0

for i in range(n):
    an = 0
    for j in range(m):
        an += al[i][j] * bl[j]

    if an + 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 = []
ans = 0
S = 0

for i in range(N):
    tmp = list(map(int,input().split()))
    for j in range(len(tmp)):
        S += tmp[j]*B[j]
    S += C

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np

N,M,C=map(int,input().split())
B=input().split()
A=[]
Ans=[]
count=0
for i in range(M):
    B[i]=int(B[i])
for i in range(N):
    A.append(input().split())
for i in range(N):
    for j in range(M):
        A[i][j]=int(A[i][j])
B=np.array(B)
A=np.array(A)
#print(A,B)
Ans=np.dot(A,B)+C
Ans=Ans.tolist()
for i in range(len(Ans)):
    if Ans[i]>0:
        count=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):
  a=list(map(int,input().split()))
  p=c
  for j in range(m):
    p+=a[j]*b[j]
  if p>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()))
    res = 0
    for j in range(M):
        res += A[j]*B[j]
    res += C
    if res > 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 _ in range(n):
  a = list(map(int,input().split()))
  s = sum([x*y for x,y in zip(a,b)]) + c
  if s > 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):
    temp = a[i]
    s = 0
    for j in range(m):
        s += temp[j]*b[j]
    s += c
    if s > 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):
    now = c
    a = list(map(int, input().split()))
    for j in range(m):
        now += a[j] * b[j]
    ans += now > 0
print(ans)

Submission status: Accepted

Solution code:
import sys
import math
import itertools

N,M,C=list(map(int,input().split()))
b=list(map(int,input().split()))
count=0
for i in range(N):
	value=0
	a=list(map(int,input().split()))
	for j in range(M):
		value+=a[j]*b[j]
	if value+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=[[] for _ in range(N)]

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

Submission status: Accepted

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

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

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
f  = lambda : map(int, input().split())
n, m, c = f()
l = list(f())
ans = 0
for i in range(n):
  ans += sum(a*b for a,b in zip(f(),l))+c>0
print(ans)

Submission status: Accepted

Solution code:
n, m, c = map(int, input().split())
lb = list(map(int, input().split()))
ans = 0
for i in range(n):
  la = list(map(int, input().split()))
  ans += sum(a*b for a,b in zip(la,lb))+c>0
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

ABC121B()

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

Submission status: Accepted

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

sorce = 0
for i in range(len(aList)):
  result = 0
  for j in range(m):
   result += aList[i][j]*bList[j]
  if result+c > 0:
    sorce += 1 

print(sorce)

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):
    score = np.dot(A[i], B) + C
    if score > 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
for i in range(n):
    if sum(list([a*b for (a,b) in zip(A[i],b)]))+c > 0:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
def main():
    N, M, C = map(int, input().split(" "))
    B = list(map(int, input().split(" ")))
    result = 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:
            result += 1
    print(result)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 15, Jan, 2020
"""

import sys
import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N, M, C = map(int, readline().split())
B = np.array(readline().split(), dtype=np.int64)
A = [np.array(readline().split(), dtype=np.int64) for _ in range(N)]

A = A * B
ans = 0
for i in A:
    if sum(i) + C > 0:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
import sys
import numpy as np

n, m, c = map(int, sys.stdin.readline().split())
b = np.array(sys.stdin.readline().split(), dtype=np.int64)
a = np.array(sys.stdin.read().split(), dtype=np.int64).reshape(n, m)

def main():
    res = np.sum(a * b, axis=1) + c
    return np.count_nonzero(res > 0)

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

ok = 0
for i in range(n):
   a = [int(x)*y for x, y in zip(input().split(), b)]
   if (sum(a) + c > 0):
      ok += 1
print(ok)

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 = list(map(int,input().split()))
    sum = c

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

    if sum > 0:
        count += 1
    else:
        pass

print(count)

Submission status: Accepted

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

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [[int(j) for j in input().split()] for i in range(N)]
ans = 0
for a in A:
    count = 0
    for i in range(M):
        count += a[i] * B[i]
    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 i in range(n)]

ans = 0 
for row in A:
    t = c    
    for a,b in zip(row,B):
        t += a*b
    if t > 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)]

count = 0

for row in A:
    cal = 0
    for col in enumerate(row):
        cal += col[1] * B[col[0]]
    cal += C
    if cal > 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
ans = 0
for i in range(n):
  l = list(map(int,input().split()))
  for j in range(m):
    ans += b[j]*l[j]
  if ans +c > 0:
    count += 1
    
  ans = 0
print(count)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = []
for _ in range(N) :
  l = list(map(int, input().split()))
  A.append(l)
#print (A)

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

Submission status: Accepted

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

for i in range(N):
    if sum(list([a*b for (a,b) in zip(A[i],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 _ in range(N):
    A = list(map(int,input().split()))
    sum_value = 0
    for i in range(M):
        sum_value += A[i]*B[i]
    if sum_value+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()))
    tmp = c
    for j,k in zip(a,b):
        tmp += j * k
    if tmp > 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)]

total = 0
ans = 0

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

Submission status: Accepted

Solution code:
import pprint
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 j in range(N):
    calc_result = 0
    for k in range(M):
        calc_result += A[j][k] * B[k]
    calc_result += C
    if calc_result > 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)]
buf=0
for i in range(n):
    a_sum=0
    for j in range(m):
        a_sum+=a[i][j]*b[j]
    a_sum+=c
    if a_sum>0:
        buf+=1
    else:
        continue
print(buf)

Submission status: Accepted

Solution code:
n,m,c=map(int,input().split())
B=list(map(int,input().split()))
x=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: x+=1
print(x)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = []
for A in As:
    ans.append(sum([a * B for a, B in zip(A, Bs)]) + C > 0)
print(sum(ans))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input():
    return sys.stdin.readline().rstrip()

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