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((int(x) for x in input().split())) for _ in range(n)]

cnt = 0
for i in range(n):
    wk = sum([ai*bi for ai, bi in zip(a[i], b)]) + c
    if wk > 0:
        cnt += 1
ans = cnt
print(ans)

Submission status: Accepted

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

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):
  s = sum([a[i][j]*b[j] for j in range(m)])
  if s+c > 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()]
A = [[int(i) for i in input().split()] for _ in range(N)]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np
n, m, c = map(int, input().split())
b = np.array(list(map(int, input().split())))

cnt = 0
for i in range(n):
    a = np.array(list(map(int, input().split())))
    if np.dot(a, b) + c > 0:
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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

    ret = 0
    for n in range(N):
        k = C
        for m in range(M):
            k += A[n][m] * B[m]

        if k > 0:
            ret += 1

    print(ret)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC121

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

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

print(count)

Submission status: Accepted

Solution code:
#import sys
#import math
#import numpy as np
'''a,b= map(int,input().split())'''
#a, b, c = [list(map(int, input().split())) for _ in range(3)]
#li0= [int(x) for x in input().split()]
#n,l= map(int, input().split())
#x = [list(map(int, input().split())) for _ in range(n)] 
a,b,c=map(int,input().split())
li=[list(map(int,input().split())) for _ in range(a+1)]
ans=ju=0
for i in range(1,a+1):
  ans=0
  for j in range(b):
    ans+=li[0][j]*li[i][j]
  ans+=c
  if ans>0:
    ju+=1
print(ju)

Submission status: Accepted

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

import numpy

def main():
  n, m, c = map(int, input().split())
  B = numpy.array(list(map(int, input().split())))
  count = 0
  for _ in range(n):
    A = numpy.array(list(map(int, input().split())))
    if sum(A*B) + c > 0:
      count += 1
  print(count)


if __name__=='__main__':
  main()

Submission status: Accepted

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


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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

print(count)

Submission status: Accepted

Solution code:
# coding: utf-8

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

b = list(map(int, input().rstrip().split(" ")))
a = [list(map(int, input().rstrip().split(" "))) for i in range(n)]

ans = [k for k in [sum([ b[i]*j[i] for i in range(m)]) for j in a] if k + c > 0]

print(len(ans))

Submission status: Accepted

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

ans=0

for i in range(n):
    templ=al[i]
    total=c
    for j in range(m):
        total+=templ[j]*bl[j]
    if total>0:
        ans+=1

print(ans)

Submission status: Accepted

Solution code:
import numpy as np


def mul(A, B):
    v = 0
    for a, b in zip(A, B):
        v += a * b
    return v


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

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

    cnt = 0
    for _ in range(N):
        A = [int(v) for v in input().split()]
        if mul(A, B) + 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()))
cnt = 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:
    cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np
N, M, C = map(int, input().split())

Bin = list(map(int, input().split()))
B = np.array(Bin).T

ans = 0
for i in range(N):
  Ain = list(map(int, input().split()))
  A = np.array(Ain)
  s = np.dot(A, B) + C
  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()))
As = [list(map(int, input().split())) for _ in range(N)]

ans = 0
for A in As:
    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 = map(int, input().split())
B_li = list(map(int, input().split()))
A_li = []
ans = 0
for i in range(N) :
    A_li = list(map(int, input().split()))
    inner_product = C
    for j in range(M) :
        inner_product +=  A_li[j] * B_li[j]
    if inner_product > 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()]
ans = 0
for s in range(n):
    a = [int(x) for x in input().split()]
    scr = sum([a[i]*b[i] for i in range(m)]) + c
    if scr > 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 _ in range(n):
  a = np.array(list(map(int, input().split())))
  if sum(a*b) + c > 0:
    ans += 1
print(ans)

Submission status: Accepted

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

for i in range(N):
    a = list(map(int, input().split()))
    add = 0
    for j in range(M):
        add += a[j] * b[j]

    if add + C > 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):
    
    a=list(map(int,input().split()))
    wrk=0
    for j in range(m):
        wrk+=a[j]*b[j]
    if(wrk+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)]
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
    else:
        cnt=cnt
print(cnt)

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

print(ans)

Submission status: Accepted

Solution code:
[N,M,C] = list(map(int,input().split()))
B = list(map(int,input().split()))
A = []
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)

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):
    sum = C
    for j in range(M):
        sum += A[i][j]*B[j]
    if sum > 0:
        cnt += 1
    else:
        cnt = cnt
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)]
count = 0
_sum  = 0
for a in A:
    for y,z in zip(a,B):
        _sum += y * z
    if _sum + C > 0:
        count += 1
    _sum = 0
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 l in A:
    r = 0
    for j in range(M):
        r += l[j]*B[j]
    if r + 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)]
count = 0
_sum  = 0
for i, x in enumerate(A):
    for j in range(M):
        _sum += x[j] * B[j]
    if _sum + C > 0:
        count += 1
    _sum = 0
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//math.factorial(n-r)*math.factorial(r)


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

Submission status: Accepted

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

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

A = [[int(i) for i in input().split()] for _ in range(n)]
ans = 0

ans_list = []
for i in range(n):
  x = 0
  for j in range(m):
    x += A[i][j]*B[j]
    if j == m-1:
      ans_list.append(x+c)
      
for i in range(len(ans_list)):
  if ans_list[i] >0:
               ans+=1
               
print(ans)

Submission status: Accepted

Solution code:
N_ko, M_d, Const = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0

for i in range(N_ko):
    summ = 0
    
    A = list(map(int, input().split()))
    
    for j in range(M_d):
        summ += A[j] * B[j]
    
    if (summ + Const > 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):
    x = 0
    A = list(map(int,input().split()))
    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()))
p = 0
for i in range(n):
    x = 0
    a = list(map(int,input().split()))
    for j in range(m):
        x += a[j] * b[j]
    if x > (-c):
        p += 1

print(p)

Submission status: Accepted

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

ans = 0
solve = 0

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

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

Solution code:
n, m, c = list(map(int, input().split()))
B = list(map(int, input().split()))
A = (list(map(int, input().split())) for _ in range(n))
ans = 0
cnt = 0
for i, u in enumerate(A):
    for j, v in enumerate(u):
        ans += v * B[j]

    ans += c
    if ans > 0:
        cnt += 1
    ans = 0
print(cnt)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

#----------
N,M,C = list(map(int, input().rstrip().split()))
B_list = list(map(int, input().rstrip().split()))
#----------

count=0
for n in range(N):
    A_list = list(map(int, input().rstrip().split()))
    
    sum=0
    for m in range(M):
        sum += A_list[m] * B_list[m]
    
    sum += C
    
    if sum > 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)]

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

Submission status: Accepted

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

for k in range(n):
#行
    ab=0
    for j in range (m):
        #列
        ab+=int(a[k][j])*b[j]
    if ab+c>0:
        d+=1
print(d)

Submission status: Accepted

Solution code:
N,M,C=map(int,input().split())
b_list=list(map(int,input().split()))
a_list=[]
for _ in range(N):
    a=list(map(int,input().split()))
    a_list.append(a)
cnt=0    
for i in a_list:
    ab=[j*k for j,k in zip(i,b_list)]
    hantei=sum(ab)+C
    if hantei>0:
        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()))
d = np.zeros((n,m))
for i in range(n):
    a = list(map(int,input().split()))
    for j in range(len(a)):
        d[i][j] = a[j]
cnt = 0
for i in range(n):
    ans = 0
    for j in range(m):
        ans += d[i][j]*b[j]
    ans += c
    if ans>0:
        cnt+=1
print(cnt)

Submission status: Accepted

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

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

    sum_a[i] += C
    if(sum_a[i] > 0):
        count+=1
    

print(count)

Submission status: Accepted

Solution code:
#121_B
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
def F(A):
    return sum([A[i]*B[i] for i in range(M)])+C

cnt=0
for _ in range(N):
    A=list(map(int,input().split()))
    if F(A)>0:
        cnt+=1

print(cnt)

Submission status: Accepted

Solution code:
n,m,k = map(int, input().split())
l1 = list(map(int, input().split()))
ans = 0
sc = 0

for i in range(n):
  sc = 0
  lt = list(map(int,input().split()))
  for j in range(m):
    sc += l1[j]*lt[j]

  if sc + k> 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()]
a = []
for i in range(n):
    a_in = [int(i) for i in input().split()]
    a.append(a_in)
#ここまで入力
count = 0
for i in a:
    daisyo = 0
    for j in range(m):
        daisyo += b[j]*i[j]
    if daisyo+c > 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
import sys
read_=sys.stdin.buffer.readline

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

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

print(ans)

Submission status: Accepted

Solution code:
#ABC-121-B
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
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:
def solve():
    N, M, C = [int(_) for _ in input().split()]
    B = [int(_) for _ in input().split()]
    res = 0
    for i in range(N):
        sum = 0
        A = [int(_) for _ in input().split()]
        for a, b in zip(A, B):
            sum += a * b
        sum += C
        if sum > 0:
            res += 1
    return res
if __name__ == '__main__':
    print(solve())

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())
    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=map(int,input().split())
B=list(map(int,input().split()))
count=0
for i in range(N):
    total=C
    A=list(map(int,input().split()))
    for j in range(M):
        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()))

result = 0

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

print(result)

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())
Blist = list(map(int, input().split()))
ans = 0
for i in range(N):
    score = C
    Alist = list(map(int, input().split()))
    for j in range(M):
        score += Alist[j]*Blist[j]
    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()))
#la = [li[0]][li[1]]

cnt = 0

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

Submission status: Accepted

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

cnt=0
for i in range(n):
            a_l_i = list(map(int,input().split()))
            c_l = 0
            for j in range(m):
                        c_l += a_l_i[j] * b_l[j]
            last_ = c_l + c

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

Submission status: Accepted

Solution code:
def main():
  import numpy as np
  import sys 
  input=sys.stdin.readline
  n,m,c=map(int,input().split())
  B=list(map(int,input().split()))
  B=np.array(B)
  cnt=0
  for i in range(n):
    A=np.array(list(map(int,input().split())))
    if (B*A).sum()+c>0:
      cnt+=1
  print(cnt)
if __name__=='__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
cnt=0;p=0
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
A=[list(map(int, input().split())) for t in range(N)]
cnt=0;p=C
#print(B)
#print(A)
for i in range(N):
  for j in range(M):
    p=p+A[i][j]*B[j]
  if p>0:
    cnt+=1
  p=C
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):
    su = 0
    for j in range(m):
        su += b[j] * a[i][j]
    
    if su + 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 _ in range(n):
    a=[int(i) for i in input().split()]
    sum1=[i*j for i,j in zip(a,b)]
    if sum(sum1)+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 i in range (N):
	A.append(list(map(int,input().split())))
tmp=0
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()))
ans=0
for i in range(n):
    buf=0
    a=list(map(int,input().split()))
    for j in range(m):
        buf+=a[j]*b[j]
    if buf+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)]
ls=[]
d=C
for i in range(N):
  for j in range(M):
    d+=A[i][j]*B[j]
  if d>0:
    ls.append(d)
  d=C
print(len(ls))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc121/tasks/abc121_b

n, m, c = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
cnt = 0
for _ in range(n):
    a = [int(x) for x in input().split()]
    if sum([ea * eb for ea, eb in zip(a, b)]) + c > 0:
        cnt += 1
print(cnt)