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:
def i():
    return int(input())
def i2():
    return map(int,input().split())
def s():
    return str(input())
def l():
    return list(input())
def intl():
    return list(int(k) for k in input().split())

n,m,c=i2()
b=intl()
a = [intl() for _ in range(n)]
d=0
flag=0
for i in range(n):
	for j in range(m):
		d+=a[i][j]*b[j]
		#print(d,'j')
	if d>-c:
		flag+=1
	d=0
	#print(d,'i')
	#print(-c)
	#print(flag)
print(flag)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m, c = map(int, input().split())
B = list(map(int, input().split()))
A = []
cnt = 0
for i in range(n):
    tmp = list(map(int, input().split()))
    A.append(tmp)


for i in range(n):
    tmp = c
    for j in range(m):
        tmp += A[i][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(' ')))

cnt = 0
for i in range(n):
    A = list(map(int, input().split(' ')))
    cnt += sum([a*b for a,b in zip(A,B)]) + c > 0

print(cnt)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

    if ans > 0:
        res += 1

print(res)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

import numpy as np

def main():
    n,m,c = map(int, input().split())
    b_li = np.array(list(map(int, input().split())))

    ans = 0

    for i in range(n):
        a_li = np.array(list(map(int, input().split())))

        if np.dot(a_li, b_li)+c > 0:
            ans += 1

    print(ans)




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 _ in range(n):
  a = [int(x) for x in input().split()]
  tsum = c
  for x,y in zip(a,b):
    tsum+=x*y
  if tsum > 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 x in range(N):
    a.append(list(map(int, input().split())))

sm = 0
ans = 0

for x in a:
    for y, z in zip(x, b):
        sm += y*z
    sm += C
    if sm > 0:
        ans += 1
    sm = 0

print(ans)

Submission status: Accepted

Solution code:
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
cnt = 0
for i in range(n):
    a = list(map(int, input().split()))
    sum = c
    for j in range(m):
        sum += a[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()))
count = 0
for i in range(N):
  A=list(map(int, input().split()))
  hyoka = 0
  for k in range(M):
    hyoka = hyoka + A[k]*B[k]
  if hyoka+C > 0:
    count = count + 1
print(count)

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np

lines = stdin.readlines()
n, m, c = [int(x) for x in lines[0].rstrip().split()]
b = [int(x) for x in lines[1].rstrip().split()]
a_s = np.zeros((n, m))
count = 0
for i in range(n):
    a_s[i] = [int(x) for x in lines[i+2].rstrip().split()]
    prod = sum(a_s[i] * b)
    if prod + c > 0:
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
n,m,c = i2()
b = intl()
cnt = 0
s = 0
for i in range(n):
    a = intl()
    for i in range(m):
        s += a[i]*b[i]
    if s+c > 0:
        cnt += 1
    s = 0
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
row = input().split(' ')
n = int(row[0])
m = int(row[1])
c = int(row[2])
b_list = [int(b) for b in input().split(' ')]
a_mat = list()
for _ in range(n):
    a_mat.append([int(a) for a in input().split(' ')])
ans = 0
for i in range(n):
    v = c + sum([a * b for a, b in zip(a_mat[i], b_list)])
    if v > 0:
        ans += 1
print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    N, M, C = map(int, input().split())
    B = list(map(int, input().split()))
    ans = 0
    for _ in range(N):
        A = list(map(int, input().split()))
        x = C
        for i in range(M):
            x += A[i]*B[i]
        if x > 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()))
ans = 0
for i in range(n):
  a = list(map(int,input().split()))
  count = 0
  for j in range(m):
    count += b[j]*a[j]
  count += c
  if count > 0:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
def resolve():
    cnt = 0
    n, m, c = map(int, input().split())
    b_list = list(map(int, input().split()))
    for i in range(n):
        a_list = list(map(int, input().split()))
        siki = 0
        for x in range(m):
            siki += (a_list[x] * b_list[x])
        if siki+c > 0:
                cnt += 1
    print(cnt)
resolve()

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

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

Submission status: Accepted

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

for i in range(n):
    lsa = list(map(int, input().split()))
    lsab = [0 for x in range(m)]
    k = 0
    for j in range(m):
        lsab[j] = lsa[j] * lsb[j]
    k = sum(lsab) + c
    if k > 0:
            l += 1

print(l)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 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()))

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

count = 0
for i in range(N):
    tmp_sum = C
    for j in range(len(a[i])):
        tmp_sum += a[i][j] * b[j]

    if tmp_sum > 0:
        count+= 1
    else:
        tmp_sum = 0

print(count)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

Submission status: Accepted

Solution code:
import numpy as np
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [ ]
for i in range(N):
  AA = list(map(int, input().split()))
  A.append(AA)
Bnp = np.array(B)
Anp = np.array(A)
C = np.dot(Anp, Bnp) + C
D = 0
for i in range(N):
  if C[i] > 0:
    D += 1
print(D)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

A = [stdin.readline().rstrip().split() for _ in range(N)]

ans = []
for i in range(N):
    L = []
    for j, v in enumerate(B):
        L.append(int(A[i][j]) * B[j])
    ans.append(sum(L) + C)


count = 0
for i in ans:
    if (i > 0):
        count += 1
# print(ans)
print(count)

Submission status: Accepted

Solution code:
nmc = list(map(int,input().split()))
b = list(map(int,input().split()))
cnt = 0
for i in range(nmc[0]):
    a = list(map(int,input().split()))
    #print(a)
    t = 0
    for j in range(len(a)):
        t += a[j]*b[j]        
    #print(t)
    if t + nmc[2] >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())))

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

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

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

Submission status: Accepted

Solution code:
N,M,C=map(int,input().split())
b = input().rstrip().split(' ')
count = 0
for i in range(N):
  t = input().rstrip().split(' ')
  total = 0
  for j in range(M):
    total += int(t[j]) * int(b[j])
  total += C
  if total > 0:
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m,c = map(int,raw_input().split())
b = map(int,raw_input().split())
 
res = 0
for i in range(n):
    ai = map(int,raw_input().split())
    ab = [ai[j] * b[j] for j in range(m)]
    if sum(ab) +c > 0:
        res +=1
print res

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

Submission status: Accepted

Solution code:
#ABC121-B
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = [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]
        
    tmp += c
    if tmp > 0:
        cnt += 1
        
print(cnt)

Submission status: Accepted

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

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

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

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

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

print(count)

Submission status: Accepted

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

ans = 0
for i in range(a):
  if sum((np.array(b_list) * np.array(a_list[i])).tolist()) + c > 0:
    ans +=1
    
print(ans)

Submission status: Accepted

Solution code:
n, m, c = map(int, input().split())
B_list = list(map(int, input().split()))
A_list = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n):
    temp_n = 0
    for j in range(m):
        temp_n += A_list[i][j] * B_list[j]
    if temp_n + c > 0:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, M, C = lr()
B = np.array(lr())
A = np.array([lr() for _ in range(N)])
answer = ((A*B).sum(axis=1) + C > 0).sum()
print(answer)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, M, C = lr()
B = np.array(lr())
answer = 0
for i in range(N):
    A = np.array(lr())
    bl = (A * B).sum() + C > 0
    if bl:
        answer += 1

print(answer)

Submission status: Accepted

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

ans = 0

for n in range(N):
    A = list(map(int,input().split()))
    tmp_n = C
    for a,b in zip(A,B):
        tmp_n += a*b

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
N,M,C = list(map(int, input().split()))
B = list(input().split())
A = list([input().split() for i in range(N)])
count = 0
for i in range(N):
    D_list =[] 
    for j in range(M):
        D =  int(A[i][j])*int(B[j])
        D_list.append(D)
    Sum = sum(D_list)
    if Sum + C > 0:
        count = 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 a in A:
    c = C
    for i, j in zip(a, B):
        c += i*j
    if c > 0:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
n,m,c=map(int,input().split())
bl=list(map(int,input().split()))
ans=0
for i in range(n):
  al=list(map(int,input().split()))
  if sum([x * y for (x, y) in zip(al,bl)])+c > 0:
    ans+=1
print(ans)

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

Submission status: Accepted

Solution code:
N, M, C = map(int, input().split())
import numpy as np
B = np.array(list(map(int, input().split())))
ans = 0
for _ in range(N):
  M = list(map(int, input().split()))
  M = np.array(M)
  if np.sum(B * M) +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()))
a=[list(map(int, input().split())) for _ in range(n)]

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

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

lailb = list()
ans = 0
for i in range(N):
    lailb = [la[i][k] * lb[k] for k in range(M)]
    #print(lailb)
    if sum(lailb) + C > 0:
        ans += 1
    
print(ans)

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    n,m,c=map(int,input().split())
    b=list(map(int,input().split()))
    icnt=0
    for i in range(n):
        ai=list(map(int,input().split()))
        ab=0
        for ii in range(m):
            ab+=ai[ii]*b[ii]
        if 0<ab+c:
            icnt+=1
    print(icnt)

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
l = []

for i in range(n):
  for j in range(m):
    l.append(a[i][j] * b[j]) 
  if sum(l) + c > 0:
      ans += 1
      l.clear()
  else:
      l.clear()

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7


def main():
  N, M, C = map(int, readline().split())
  B = np.array(readline().split(), np.int64)
  A = list(list(map(int, readline().split()))for _ in range(N))
  A = np.array(A, np.int64)
  ABC = np.dot(A,B) + C
  print(np.where(ABC>0, 1, 0).sum())
  
  
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m, c = map(int,input().split())
b_list = list(map(int,input().split()))
a_list = []
for i in range(n):
    a_list.append(list(map(int,input().split())))
count = 0

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

print(count)

Submission status: Accepted

Solution code:
def resolve():
    N, M, C = map(int, input().split())
    Blist = [int(i) for i in input().split()]
    count = 0
    for i in range(N):
        Alist = [int(j) for j in input().split()]
        if sum(Alist[j] * Blist[j] for j in range(M)) + C > 0:
            count += 1
    print(count)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline


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

print(ans)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc121/tasks/abc121_b
n, m, c = map(int, input().split())

B = [int(i) for i in input().split()]
codes = []
for _ in range(n):
    row = [int(i) for i in input().split()]
    codes.append(row)

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

Submission status: Accepted

Solution code:
# ABC 121: B – Can you solve this?
N, M, C = [int(s) for s in input().split()]
B = [int(s) for s in input().split()]
A = [[int(s) for s in input().split()] for _ in range(N)]

exacts = 0

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

print(exacts)

Submission status: Accepted

Solution code:
n,m,c = map(int,input().split())
b_line = [int(b) for b in input().split()]
a_lines = [[int(j) for j in input().split()] for i in range(n)]

count = 0
for a_line in a_lines:
    result = c
    for a,b in zip(a_line,b_line):
        result += a*b
    if result>0:
        count+=1
print(count)

Submission status: Accepted

Solution code:
import numpy as np

N, M, C = map(int, input().split())
B = np.array(input().split(), dtype=np.int32)
A = np.array([input().split() for _ in range(N)], dtype=np.int32)
print(((A * B).sum(axis=1) + C > 0).sum())

Submission status: Accepted

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

    ans = 0
    for i in range(N):
        A = list(map(int, input().split()))
        if sum([A[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())
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]

import numpy as np
count = 0
b = np.array(b)
for i in range(n):
  ai = np.array(a[i])
  if np.dot(ai,b)+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.array([list(map(int,list(input().split()))) for i in range(n)])
ans=0
for i in range(n):
    if sum(a[i][:]*b)+c>0:
        ans+=1
print(ans)