# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161853 | boolodifjenula | Baza (COCI17_baza) | Cpython 3 | 625 ms | 36124 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
N,M=map(int,input().split())
L=[]
for i in range(N):
L+=[list(map(int,input().split()))]
Q=int(input())
R=Q*[0]
for x in range (Q):
Z=list(map(int,input().split()))
for y in range(N):
for z in range(M):
if Z[z]!=-1 and Z[z]!=L[y][z]:
break
if z==M-1:
R[x]+=1
for i in range(Q):
print(R[i])
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |