s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s592537250 | p03804 | u080986047 | 1587073649 | Python | PyPy3 (2.4.0) | py | Runtime Error | 193 | 39792 | 498 | n,m = map(int,input().split())
a = [list(input())for i in range(n)]
b = [list(input())for i in range(m)]
count = 0
for x in range (m):
#print(x)
for y in range(n):
#print(y)
for z in range(n-m):
#print(z)
for p in range(m):
#print(p)
if b[x+p] == a[y+p][z:(z+m)]:
count +=1
if count == m:
print("Yes")
exit()
else:
print("No") |
s752639914 | p03804 | u535659144 | 1587063623 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 397 | n,m=map(int,input().split())
a=[list(input())for i in range(n)]
b=[list(input())for j in range(m)]
for i in range(n-m):
for x in range(n-m):
if a[i][x:x+m]==b[i]:
flag=1
for j in range(1,m):
if a[i+j][x:x+m]!=b[i+j]:
flag=0
if flag:
print("Yes")
exit()
print("No")
|
s277955431 | p03804 | u535659144 | 1587063250 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 394 | n,m=map(int,input().split())
a=[list(input())for i in range(n)]
b=[list(input())for j in range(m)]
for i in range(m):
for x in range(n-m):
if a[i][x:x+m]==b[i]:
flag=1
for j in range(1,m):
if a[i+j][x:x+m]!=b[i+j]:
flag=0
if flag:
print("Yes")
exit()
print("No")
|
s319554631 | p03804 | u276115223 | 1586519600 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 794 | # ABC 054: B – Template Matching
n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
isIncluding = False
for a_row in range(n):
for a_column in range(n):
if a[a_row][a_column] == b[0][0]:
isExact = True
for b_row in range(m):
for b_column in range(1, m):
if b[b_row][b_column] != a[a_row + b_row][a_column + b_column]:
isExact = False
break
if not isExact:
isExact = True
break
else:
isIncluding = True
break
if isIncluding:
break
if isIncluding:
break
print('Yes' if isIncluding else 'No') |
s275687302 | p03804 | u276115223 | 1586435592 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 448 | # ABC 054: B – Template Matching
n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
isIncluding = 'No'
current = 0
for i in range(n):
if b[0] in a[i]:
current = a[i].index(b[0])
for j in range(1, m):
if b[j] not in a[i + j] or a[i + j].index(b[j]) != current:
break
else:
isIncluding = 'Yes'
break
print(isIncluding) |
s961252107 | p03804 | u440129511 | 1585629982 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 340 | n,m=map(int,input().split())#正方形
a= [list(input()) for _ in range(n)] #大
b= [list(input()) for _ in range(m)] #小
m1=0
for i in range(n-m+1): #行
for j in range(n-m+1): #左からの位置
if b[i][j+k]==a[i][j] for k in range(n-m+1):m1+=1
if m1==m:print('Yes') and exit()
else:pass
else:print('No') |
s805374098 | p03804 | u440129511 | 1585629925 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 340 | n,m=map(int,input().split())#正方形
a= [list(input()) for n in range(n)] #大
b= [list(input()) for m in range(m)] #小
m1=0
for i in range(n-m+1): #行
for j in range(n-m+1): #左からの位置
if b[i][j+k]==a[i][j] for k in range(n-m+1):m1+=1
if m1==m:print('Yes') and exit()
else:pass
else:print('No') |
s669670310 | p03804 | u948522631 | 1585343791 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 398 | n,m=map(int,input().split())
a=[]
b=[]
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
check = False
for i in range(n):
if b[0]in a[i]:
index=a[i].index(b[0])
check=True
for k in range(m):
if i+k>n:
check=False
break
if not b[k]in a[i+k] or a[i+k].index(b[k])!=index:
check=False
break
if check:
break
print("Yes" if check else "No") |
s278913904 | p03804 | u948522631 | 1585343649 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 400 | n,m=map(int,input().split())
a=[]
b=[]
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
check = False
for i in range(n):
if b[0]in a[i]:
index=a[i].index(b[0])
check=True
for k in range(m):
if i+k>=n:
check=False
break
if a[i+k].index(b[k])!=index or not b[k]in a[i+k] :
check=False
break
if check:
break
print("Yes" if check else "No") |
s988059609 | p03804 | u948522631 | 1585342030 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 381 | n,m=map(int,input().split())
a=[]
b=[]
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
check = False
for i in range(n):
if b[0]in a[i]:
index=a[i].index(b[0])
check=True
for k in range(m):
if i+k>=n:
break
if not b[k]in a[i+k] and a[i+k].index(b[k])!=index:
check=False
break
if check:
break
print("Yes" if check else "No") |
s736289563 | p03804 | u288430479 | 1585274980 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 240 | n,m = map(int,input().split())
list_A = list(input() for i in range(n))
list_B = list(input() for i in range(m))
t = "No"
for i in range(n-m+1):
for t in range(n-m+1):
if all(list_A[i][t:t+m+1]==list_B[i][t:t+m+1]):
print("Yes") |
s884116235 | p03804 | u877415670 | 1585197432 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3060 | 292 | n,m=map(int,input().split())
a=[input() for _ in range(n)]
b=[input() for _ in range(m)]
for i in range(m):
for g in range(m):
d=[]
for l in range(m):
d.append(a[l+i][g:g+m])
if d==b:
print("Yes")
exit()
print("No") |
s596676142 | p03804 | u230717961 | 1585196107 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3064 | 468 | n, m = [int(i) for i in input().split()]
def init_img(n):
return [[0 if j == "#" else 1 for j in input()] for i in range(n)]
img = init_img(n)
tmp_img = init_img(m)
flg = False
for i in range(n):
if flg:
break
for j in range(n):
count = 0
for k in range(m):
if img[i+k][j:j+m] == tmp_img[k]:
count += 1
if count == 3:
flg = True
if flg:
print("Yes")
else:
print("No")
|
s718841860 | p03804 | u702786238 | 1585076268 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38384 | 452 | import numpy as np
N, M = map(int, input().split())
As = np.array([["." for n in range(N)] for nn in range(N)])
for n in range(N):
As[n,:] = np.array(list(input()))
Bs = np.array([["." for n in range(M)] for nn in range(M)])
for m in range(M):
Bs[m,:] = np.array(list(input()))
ok = False
for i in range(N-M):
for j in range(N-M):
if (As[i:i+M,j:j+M] == Bs).all():
ok = True
break
if ok:
print("Yes")
else:
print("No") |
s804997046 | p03804 | u375616706 | 1584895721 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38896 | 634 | N, M = map(int, input().split())
gridA = [[v for v in input()] for _ in range(N)]
gridB = [[v for v in input()] for _ in range(M)]
for x_A in range(N):
for y_A in range(N):
ok = True
for x_B in range(M):
for y_B in range(M):
if x_A+x_B > N or y_A+y_B > N:
break
if gridA[x_A+x_B][y_A+y_B] == gridB[x_B][y_B]:
continue
else:
ok = False
break
else:
continue
break
else:
print("Yes")
exit()
print("No")
|
s445287672 | p03804 | u375616706 | 1584895671 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38896 | 561 | N, M = map(int, input().split())
gridA = [[v for v in input()] for _ in range(N)]
gridB = [[v for v in input()] for _ in range(M)]
for x_A in range(N):
for y_A in range(N):
ok = True
for x_B in range(M):
for y_B in range(M):
if gridA[x_A+x_B][y_A+y_B] == gridB[x_B][y_B]:
continue
else:
ok = False
break
else:
continue
break
else:
print("Yes")
exit()
print("No")
|
s914180217 | p03804 | u580404776 | 1584660071 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3064 | 545 | N,M=map(int,input().split())
A=[list(input()) for i in range(N)]
B=[list(input()) for i in range(M)]
ans=0
for i in range(N-M+1):
for j in range(N-M+1):
if A[i][j]==B[0][0]:
for k in range(0,M):
for l in range(0,M):
if A[i+k][j+l]==B[k][l]:
ans+=1
if ans==M**2:
flag=1
else:
ans=0
break
print("Yes" if flag else "No")
|
s748560030 | p03804 | u077898957 | 1584414627 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 412 |
n,m = map(int,input().split())
A = [[input()] for i in range(n)]
B = [[input()] for i in range(m)]
ans = 0
for i in range(n-m+1):
for j in range(n-m+1):
temp=0
for k in range(m):
for l in range(m):
if B[k][l]==A[i+k][j+l]:
temp+=1
ans = max(ans,temp)
print('Yes' if ans==m*m else 'No') |
s060032241 | p03804 | u077898957 | 1584414540 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 407 | n,m = map(int,input().split())
A = [[input()] for i in range(n)]
B = [[input()] for i in range(m)]
ans = 0
for i in range(n-m):
for j in range(n-m):
temp=0
for k in range(m):
for l in range(m):
if B[k][l]==A[i+k][j+l]:
temp+=1
ans = max(ans,temp)
print('Yes' if ans==m*m else 'No') |
s621232039 | p03804 | u992910889 | 1584225621 | Python | PyPy3 (2.4.0) | py | Runtime Error | 164 | 38256 | 423 | def resolve():
N,M=map(int,input().split())
A=[list(map(int,input().split())) for i in range(N)]
B=[list(map(int,input().split())) for i in range(M)]
for i in A:
valmin=10**5
cnt=0
for j in B:
if abs(i[0]-j[0])+abs(i[1]-j[1])<valmin:
valmin=abs(i[0]-j[0])+abs(i[1]-j[1])
ans=cnt+1
cnt+=1
print(ans)
resolve() |
s650788155 | p03804 | u841623074 | 1584063120 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 390 | N,M=map(int,input().split())
A=[input()for i in range(N)]
B=[input()for i in range(M)]
b=''
a='no'
for i in range(M):
b+=B[i]
for i in range(N-M+1):
if B[0]in A[i] and B[1] in A[i+1]:
for j in range(N-M+1):
a=''
for k in range(M):
a+=A[i+k][j:j+M]
if a==b:
print("Yes")
exit()
print("No")
|
s577030329 | p03804 | u841623074 | 1584063089 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 399 | N,M=map(int,input().split())
A=[input()for i in range(N)]
B=[input()for i in range(M)]
b=''
a='no'
for i in range(M):
b+=B[i]
print(b)
for i in range(N-M+1):
if B[0]in A[i] and B[1] in A[i+1]:
for j in range(N-M+1):
a=''
for k in range(M):
a+=A[i+k][j:j+M]
if a==b:
print("Yes")
exit()
print("No")
|
s689738827 | p03804 | u841623074 | 1584062702 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 364 | N,M=map(int,input().split())
A=[input()for i in range(N)]
B=[input()for i in range(M)]
b=''
a='no'
for i in range(M):
b+=B[i]
for i in range(N-M+1):
if B[0]in A[i] and B[1] in A[i+1]:
for j in range(N-M+2):
a=''
for k in range(M):
a+=A[i+k][j:j+M]
if a==b:
print("Yes")
exit()
print("No") |
s071990011 | p03804 | u841623074 | 1584062635 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 362 | N,M=map(int,input().split())
A=[input()for i in range(N)]
B=[input()for i in range(M)]
b=''
a='no'
for i in range(M):
b+=B[i]
for i in range(N-M+2):
if B[0]in A[0] and B[1] in A[1]:
for j in range(N-M+2):
a=''
for k in range(M):
a+=A[i+k][j:j+M]
if a==b:
print("Yes")
exit()
print("No") |
s566894368 | p03804 | u841623074 | 1584062441 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 362 | N,M=map(int,input().split())
A=[input()for i in range(N)]
B=[input()for i in range(M)]
b=''
a='no'
for i in range(M):
b+=B[i]
for i in range(N-M+1):
if B[0]in A[0] and B[1] in A[1]:
for j in range(N-M+1):
a=''
for k in range(M):
a+=A[i+k][j:j+M]
if a==b:
print("Yes")
exit()
print("No") |
s176727543 | p03804 | u075595666 | 1584013838 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 416 | n,m = [int(i) for i in input().split()]
a = []
for i in range(n):
array = input()
a.append(array)
b = []
for i in range(m):
line = input()
b.append(line)
ans 'No'
for i in range (n-m+1):
for j in range(n-m+1):
Ans = ans
if a[i][j:j+m] == b[0]:
print(i,j)
for k in range(m):
if not a[i+k][j:j+m] == b[k]:
ans = Ans
continue
else:
ans = 'Yes'
print(ans)
break
print(ans) |
s020960001 | p03804 | u075595666 | 1584011142 | Python | Python (3.4.3) | py | Runtime Error | 159 | 3064 | 356 | N,M = [int(i) for i in input().split()]
a = []
for i in range(N):
array = input()
a.append(array)
b = []
for i in range(M):
line = input()
b.append(line)
for i in range(N-M):
for j in range(N-M):
ans = 'Yes'
for n in range(M):
for m in range(M):
if a[i+n][j+m] == b[n][m]:
pass
#print(i,j,n,m)
else:
ans = 'No'
print(ans) |
s050947535 | p03804 | u075595666 | 1584011105 | Python | Python (3.4.3) | py | Runtime Error | 494 | 5656 | 355 | N,M = [int(i) for i in input().split()]
a = []
for i in range(N):
array = input()
a.append(array)
b = []
for i in range(M):
line = input()
b.append(line)
for i in range(N-M):
for j in range(N-M):
ans = 'Yes'
for n in range(M):
for m in range(M):
if a[i+n][j+m] == b[n][m]:
pass
print(i,j,n,m)
else:
ans = 'No'
print(ans) |
s941435008 | p03804 | u626468554 | 1583853355 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 652 | #n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))
N,M = map(int,input().split())
A = [list(input()) for _ in range(N)]
B = [list(input()) for _ in range(M)]
flg1 = 1
flg2 = 0
for i in range(N):
if flg2:
break
for j in range(N):
if flg2:
break
flg1 = 1
for k in range(M):
if not(flg1):
break
for l in range(M):
if A[i+k][j+l]==B[k][l]:
continue
else:
flg1 = 0
else:
print("Yes")
flg2 = 1
else:
print("No") |
s408118126 | p03804 | u428132025 | 1583808092 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 499 | n, m = map(int, input().split())
a, b = [0] * n, [0] * m
for i in range(n):
a[i] = list(input())
for i in range(m):
b[i] = list(input())
for sx in range(n-1):
for sy in range(n-1):
chk = True
for tx in range(m):
for ty in range(m):
if a[sx+tx][sy+ty] == b[tx][ty]:
pass
else:
chk = False
break
if chk:
print('Yes')
exit()
print('No')
|
s643282656 | p03804 | u903005414 | 1583373517 | Python | Python (3.4.3) | py | Runtime Error | 401 | 21588 | 430 | import numpy as np
N, M = map(int, input().split())
A = np.array([list(input()) for _ in range(N)])
B = np.array([list(input()) for _ in range(M)])
# print('AB', A, B)
for i in range(N - M + 1):
for j in range(N - M + 1):
# print('i j', i, j)
A_subset = A[i:i + N - 1, j:j + N - 1]
# print('A_subset', A_subset)
if np.all(A_subset == B):
print('Yes')
exit()
print('No')
|
s042646402 | p03804 | u757030836 | 1583249919 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 387 | n,m = map(int,input().split())
a = [[str(i) for i in input()]for _ in range(n)]
b = [[str(i) for i in input()]for _ in range(m)]
for i in range(n-m+1):
for j in range(n-m+1):
c =0
for k in range(n-m+1):
for l in range(n-m+1):
if a[i+k][j+l] == b[k][l]:
c +=1
if c == 2*m:
print("Yes")
exit()
print("No") |
s748221083 | p03804 | u861141787 | 1582517621 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3064 | 527 | n, m = map(int, input().split())
a = [list(input()) for _ in range(n)]
b = [list(input()) for _ in range(m)]
si, sj = 0, 0
while si < m:
ni, nj = si, sj
rest = m ** 2
for i in range(m):
nj = sj
for j in range(m):
# print(ni, nj, i, j)
if a[ni][nj] != b[i][j]:
break
nj +=1
rest -= 1
ni += 1
if rest == 0:
print("Yes")
exit()
sj += 1
if sj > n - m:
si += 1
sj = 0
print("No")
|
s421869072 | p03804 | u861141787 | 1582514065 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 459 | n, m = map(int, input().split())
a = [list(input()) for _ in range(n)]
b = [list(input()) for _ in range(m)]
for nj in range(0, n - m):
for ni in range(0, n - m):
for i in range(m):
for j in range(m):
if a[nj][ni] == b[m-1][m-1]:
print("Yes")
exit()
if a[nj][ni] != b[j][i]:
break
nj += 1
ni += 1
print("No")
|
s296288074 | p03804 | u426572476 | 1582374621 | Python | PyPy3 (2.4.0) | py | Runtime Error | 298 | 65516 | 831 | import itertools
import math
import sys
import heapq
from collections import Counter
from collections import deque
from fractions import gcd
from functools import reduce
sys.setrecursionlimit(4100000)
from functools import lru_cache
INF = 1 << 60
#ここから書き始める
n, m = map(int, input().split())
a = [[""] * n] * n
b = [[""] * m] * m
for i in range(n):
a[i] = [j for j in input()]
for i in range(m):
b[i] = [j for j in input()]
# print(a)
# print(b)
for i in range(n - m):
for j in range(n - m):
flag = True
for k in range(i + m):
for l in range(j + m):
if a[k][l] != b[k][l]:
flag = False
break
if not flag:
break
if flag:
print("Yes")
sys.exit()
print("No")
|
s428445024 | p03804 | u686036872 | 1581584896 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 216 | N, M = map(int, input().split())
list = []
for i in range(H):
list.append(input())
count = 0
for i in range(M):
x = input()
for j in list:
if x in j:
count+=1
print("No" if count=0 else "Yes") |
s852003737 | p03804 | u549579601 | 1581191402 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38896 | 521 | a, b = map(int, input().split())
L = []
for i in range(a):
L.append([j for j in input()])
K = []
for i in range(b):
K.append([j for j in input()])
ind = 0
for i in range(a-b+1):
for j in range(a-b+1):
if L[i][j] == K[0][0] and ind == 0:
for k in range(b):
if L[i+k][j:j+b] != K[i+k]:
break
if k == b - 1 and ind == 0:
print("Yes")
ind = 1
break
if ind == 0:
print("No") |
s313823759 | p03804 | u549579601 | 1581191247 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38896 | 543 | a, b = map(int, input().split())
L = []
for i in range(a):
L.append([j for j in input()])
K = []
for i in range(b):
K.append([j for j in input()])
ind = 0
for i in range(a-b+1):
for j in range(a-b+1):
if L[i][j] == K[0][0]:
for k in range(b):
if L[i+k][j:j+b] == K[i+k]:
continue
else:
break
if k == b - 1 and ind == 0:
print("Yes")
ind = 1
break
if ind == 0:
print("No") |
s339580842 | p03804 | u549579601 | 1581191140 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38896 | 483 | a, b = map(int, input().split())
L = []
for i in range(a):
L.append([j for j in input()])
K = []
for i in range(b):
K.append([j for j in input()])
for i in range(a-b+1):
for j in range(a-b+1):
if L[i][j] == K[0][0]:
for k in range(b):
if L[i+k][j:j+b] == K[i+k]:
continue
else:
break
if k == b - 1:
print("Yes")
quit()
print("No") |
s202890396 | p03804 | u798818115 | 1581179845 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 549 | # coding: utf-8
# Your code here!
N,M=map(int,input().split())
AN=[]
for _ in range(N):
AN.append(list(input()))
#print(AN)
AM=[]
for _ in range(M):
AM.append(list(input()))
#print(AM)
for i in range(N-M+1):
flag=False
for j in range(N-M+1):
if AN[i][j:j+M]==AM[0]:
for k in range(i,i+M):
if AN[k][j:j+M]!=AM[k]:
flag=True
break
if flag:
break
print("Yes")
exit()
print("No") |
s881056673 | p03804 | u867848444 | 1580280235 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 510 | n,m=map(int,input().split())
a=[input() for i in range(n)]
b=[input() for i in range(m)]
if m==1:
for i in a:
if b[0] in i:
print('Yes')
exit()
else:
print('No')
exit()
for i in range(n-m+1):
cnt=0
while cnt < n - m:
l=[]
for j in range(n-m+1):
#bと同じ長さの部分配列を作る
l+=[a[j+cnt][i:i+m]]
if l==b:
print('Yes')
exit()
cnt+=1
print('No') |
s404679887 | p03804 | u690781906 | 1580251879 | Python | PyPy3 (2.4.0) | py | Runtime Error | 164 | 38512 | 438 | n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
for i in range(n):
for j in range(n):
flag = True
for k in range(m):
for l in range(m):
if a[i+k][j+l] != b[k][l]:
flag = False
break
if not flag:
break
if flag:
print('Yes')
exit()
print('No') |
s641427007 | p03804 | u594244257 | 1579272458 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 549 | def solve():
N,M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
idx = 0
start_pos = {}
for S_a in A:
indices = set(find_indices(S_a, B[idx], N))
if not start_pos:
start_pos = indices
else:
start_pos &= indices
if start_pos:
idx += 1
else:
start_pos = {}
idx = 0
if idx == M:
break
print('Yes' if start_pos else 'No')
solve() |
s944984518 | p03804 | u530786533 | 1579215057 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 399 | n, m = map(int, input().split())
a = []
for i in range(n):
a.append(input())
b = []
for i in range(m):
b.append(input())
def func(base, target):
for i in range(n-m+1):
check = base[i:i+m]
for j in range(n-m+1):
check2 = [line[j:j+m] for line in check]
if check2 == target:
return print('Yes')
return print('No')
func(a,b)
|
s029418797 | p03804 | u609061751 | 1578862643 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 550 | import sys
input = sys.stdin.readline
N, M = [int(x) for x in input().split()]
A = []
for _ in range(N):
A.append(list(input().rstrip()))
B = []
for _ in range(M):
B.append(list(input().rstrip()))
m = len(B[0])
def search(point):
x, y = point
for i in range(M):
if y > N:
return 0
a = A[y][x:x + m]
if a != B[i]:
return 0
y += 1
return 1
for i in range(N):
for j in range(len(A[0])):
if search([i, j]):
print("Yes")
sys.exit()
print("No") |
s488711077 | p03804 | u485566817 | 1578451623 | Python | Python (3.4.3) | py | Runtime Error | 182 | 3064 | 427 | n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
flag = False
for i in range(n):
for j in range(n-m+1):
cnt = 0
for k in range(m):
for l in range(m):
if a[i+k][j+l] == b[k][l]:
cnt += 1
if cnt == m**2:
flag = True
break
if flag:
break
print("Yes" if flag else "No") |
s323381353 | p03804 | u334712262 | 1578358304 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 372 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
def f(i, j):
for k in range(i, i+M):
for l in range(j, j+M):
if A[i+k][j+l] != B[k][l]:
return False
return True
def slv():
for i in range(N-M+1):
for j in range(N-M+1):
if f(i, j):
return 'Yes'
return 'No'
print(slv())
|
s623611207 | p03804 | u506587641 | 1578329475 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 386 | n,m = map(int,input().split())
a = [str(input()) for _ in range(n)]
b = [str(input()) for _ in range(m)]
flag = False
for k in range(n-m+1):
cnt = 0
for i in range(m):
for j in range(m):
if b[k+i][j]==a[k+i][j]:
cnt += 1
if cnt==m**2:
flag = True
break
if flag:
break
print('Yes' if flag else 'No') |
s807010095 | p03804 | u143903328 | 1578168200 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 456 | m,n = map(int,input().split())
a = []*m
b = []*n
flag = False
for i in range(m):
a.append(input())
for j in range(n):
b.append(input())
for i in range(m-n+1):#比較開始を縦方向に動かす
for j in range(m-n+1):#比較開始を横方向へ動かす
for k in range(n+1):#各行を縦方向に比較
if b[k] != a[i][j:j+n]:
break
flag = True
if flag:
print('Yes')
else:
print('No') |
s600680796 | p03804 | u143903328 | 1578168147 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 476 | m,n = map(int,input().split())
a = []*m
b = []*n
flag = False
for i in range(m):
a.append(input())
for j in range(n):
b.append(input())
print(a)
print(b)
for i in range(m-n+1):#比較開始を縦方向に動かす
for j in range(m-n+1):#比較開始を横方向へ動かす
for k in range(n+1):#各行を縦方向に比較
if b[k] != a[i][j:j+n]:
break
flag = True
if flag:
print('Yes')
else:
print('No')
|
s191363576 | p03804 | u143903328 | 1578168091 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 476 | m,n = map(int,input().split())
a = []*m
b = []*n
flag = False
for i in range(m):
a.append(input())
for j in range(n):
b.append(input())
print(a)
print(b)
for i in range(m-n+1):#比較開始を縦方向に動かす
for j in range(m-n+1):#比較開始を横方向へ動かす
for k in range(n+1):#各行を縦方向に比較
if b[k] != a[i][j:j+n]:
break
flag = True
if flag:
print('Yes')
else:
print('No')
|
s541163931 | p03804 | u520276780 | 1578126585 | Python | PyPy3 (2.4.0) | py | Runtime Error | 164 | 38256 | 481 | n,m = map(int, input().split())
a = []
b = []
for i in range(n):
ai = input()
a.append(ai)
for i in range(m):
bi = input()
b.append(bi)
flag = True
for i in range(n-m+1):
flag = True
for k in range(n-m+1):
for j in range(i,i+m+1):
if a[j][k:k+m]!=b[j-i]:
flag = False
break
if flag:
break
if flag:
break
#print(i,k,flag)
print("Yes" if flag else "No")
|
s215098766 | p03804 | u608726540 | 1577954363 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3060 | 447 | n,m=map(int,input().split())
a=[input() for i in range(n)]
b=[input() for i in range(m)]
for i in range(n-m):
for j in range(n-m):
flag=True
for k in range(m):
for l in range(m):
if a[i+k][j+l]!=b[k][l]:
flag=False
break
if not flag:
break
if flag:
print('Yes')
break
if not flag:
print('No')
|
s447341975 | p03804 | u875600867 | 1577740843 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 769 | import re
N,M=map(int, input().split())
A=[]
B=[]
for n in range(N):
A.append(input())
for m in range(M):
B.append(input())
if N<M:
print("No")
exit()
# check
for n in range(N):
# Bのm行目と一致
# Bのm+1行目と一致するかチェック
span =[m.span() for m in re.finditer(B[0], A[n])]
#print(span)
if span==[]:
continue
allgood=False
for i in range(min(M,N)):
#print(n)
#print((B[i],A[n+i][span[0][0]:span[0][1]]))
if (B[i]==A[n+i][span[0][0]:span[0][1]]):
allgood=True
continue
else:
allgood=False
break
if allgood==True:
print("Yes")
exit()
print("No") |
s388303907 | p03804 | u875600867 | 1577740721 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 734 | import re
N,M=map(int, input().split())
A=[]
B=[]
for n in range(N):
A.append(input())
for m in range(M):
B.append(input())
# check
for n in range(N):
# Bのm行目と一致
# Bのm+1行目と一致するかチェック
span =[m.span() for m in re.finditer(B[0], A[n])]
#print(span)
if span==[]:
continue
allgood=False
for i in range(min(M,N)):
#print(n)
#print((B[i],A[n+i][span[0][0]:span[0][1]]))
if (B[i]==A[n+i][span[0][0]:span[0][1]]):
allgood=True
continue
else:
allgood=False
break
if allgood==True:
print("Yes")
exit()
print("No") |
s651794373 | p03804 | u875600867 | 1577662724 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3188 | 795 | import re
N,M=map(int, input().split())
A=[]
B=[]
for n in range(N):
A.append(input())
for m in range(M):
B.append(input())
# check
for m in range(M):
for n in range(N):
# Bのm行目と一致
# Bのm+1行目と一致するかチェック
span =[m.span() for m in re.finditer(B[m], A[n])]
#print(span)
if span==[]:
continue
allgood=False
for i in range(min(M,N)):
#print(n)
#print((B[i],A[n+i][span[0][0]:span[0][1]]))
if (B[i]==A[n+i][span[0][0]:span[0][1]]):
allgood=True
continue
else:
allgood=False
break
if allgood==True:
print("Yes")
exit()
print("No") |
s071812119 | p03804 | u875600867 | 1577662190 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3188 | 876 | import re
N,M=map(int, input().split())
A=[]
B=[]
for n in range(N):
A.append(input())
for m in range(M):
B.append(input())
# check
for m in range(M):
for n in range(N):
# Bのm行目と一致
# Bのm+1行目と一致するかチェック
span =[m.span() for m in re.finditer(B[m], A[n])]
#print(span)
if span==[]:
continue
allgood=False
# フィルタが1行ならYesを返す
if M==1:
print("Yes")
exit()
for i in range(0, M):
#print((B[i],A[i][span[0][0]:span[0][1]]))
if (B[i]==A[n+i][span[0][0]:span[0][1]]):
allgood=True
continue
else:
allgood=False
break
if allgood==True:
print("Yes")
exit()
print("No") |
s444525147 | p03804 | u875600867 | 1577661774 | Python | Python (3.4.3) | py | Runtime Error | 30 | 3188 | 880 | import re
N,M=map(int, input().split())
A=[]
B=[]
for n in range(N):
A.append(input())
for m in range(M):
B.append(input())
# check
for m in range(M):
for n in range(N):
# Bのm行目と一致
# Bのm+1行目と一致するかチェック
span =[m.span() for m in re.finditer(B[m], A[n])]
#print(span)
if span==[]:
continue
allgood=False
# フィルタが1行ならYesを返す
if M==1:
print("Yes")
exit()
for i in range(1, M):
#print((B[i],A[i+n][span[0][0]:span[0][1]]))
if (B[i]==A[i+n][span[0][0]:span[0][1]]):
allgood=True
continue
else:
allgood=False
break
if allgood==True:
print("Yes")
exit()
print("No")
|
s089599141 | p03804 | u063073794 | 1577499390 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 419 | yandy
N, M = map(int, input().split())
A = [''] * N
B = [''] * M
for i in range(N):
A[i] = input()
for j in range(M):
B[j] = input()
for i in range(N-M+1):
for j in range(N-M+1):
NO = False
for x in range(M):
a = A[i+x][j:j+M]
if a != B[x]:
NO = True
break
if not NO:
print('Yes')
exit()
print('No')
|
s304233318 | p03804 | u183840468 | 1577298977 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 319 | a,b = [int(i) for i in input().split()]
al = np.array([list(input()) for _ in range(a)])
bl = np.array([list(input()) for _ in range(b)])
flg = False
for i in range(a - b + 1):
for j in range(a - b + 1):
if(al[i:i+b,j:j+b] == bl).all():
flg = True
print('Yes' if flg else 'No')
|
s756458341 | p03804 | u609814378 | 1577235770 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1 | a |
s174860413 | p03804 | u376099073 | 1577143638 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 693 | n,m = map(int,input().split())
a = []
b = []
for i in range(n):
ai = list(input())
a.append(ai)
for i in range(m):
bi = list(input())
b.append(bi)
hidariue = b[0][0]
hasikouho = []
for i in range(n-m+1):
for j in range(n-m+1):
if a[i][j] == hidariue:
hasikouho.append(str(i)+":"+str(j))
x = []
for v in hasikouho:
ans = "Yes"
i = int(v[0])
j = int(v[2])
for p in range(m):
if ans == "Yes":
for q in range(m):
if a[i+p][j+q] != b[p][q]:
ans = "No"
break
else:
break
x.append(ans)
if "Yes" in x:
print("Yes")
else:
print("No")
|
s341772206 | p03804 | u940342887 | 1577054975 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 629 | N, M = map(int, input().split())
A = []
for i in range(N):
tmp = input()
A.append([0 if s=="." else 1 for s in tmp])
B = []
for i in range(M):
tmp = input()
B.append([0 if s=="." else 1 for s in tmp])
A = np.array(A)
B = np.array(B)
def is_match(a, b):
return (a==b).all()
flag = False
for i in range(N):
for j in range(N):
x_left = i
x_right = i + M
y_up = j
y_under = j + M
if x_right >= N or y_under >= N:
continue
if is_match(B, A[x_left:x_right, y_up:y_under]):
flag = True
if flag:
print("Yes")
else:
print("No") |
s064586091 | p03804 | u940342887 | 1577054950 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 412 | print(A)
# 全探索で間に合う？
def is_match(a, b):
return (a==b).all()
flag = False
for i in range(N):
for j in range(N):
x_left = i
x_right = i + M
y_up = j
y_under = j + M
if x_right >= N or y_under >= N:
continue
if is_match(B, A[x_left:x_right, y_up:y_under]):
flag = True
if flag:
print("Yes")
else:
print("No") |
s502446534 | p03804 | u905582793 | 1575606961 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 407 | N,M = map(int,input())
A = [input() for _ in range(N)]
B = [input() for _ in range(N)]
ans = 0
for i in range(N-M+1):
for j in range(N-M+1):
for k in range(i,i+M):
for l in range(j,j+M):
if A[k][l] != B[k][l]:
break
if A[k][l] == B[k][l] and k == i+M-1 and l == j+M-1:
ans = 1
else:
continue
break
if ans == 0:
print("No")
else:
print("Yes") |
s491931382 | p03804 | u930841425 | 1575162535 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 754 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool solve() {
ll N, M;
cin >> N >> M;
vector<string> A(N), B(M);
for ( int i = 0; i < N; i++ ) {
cin >> A[i];
}
for ( int i = 0; i < M; i++ ) {
cin >> B[i];
}
for ( int i1 = 0; i1 + M < N; i1++ ) {
for ( int i2 = 0; i2 + M < N; i2++ ) {
bool ng = false;
for ( int j1 = 0; j1 < M; j1++ ) {
if ( A[i1+j1].substr(i2, M) != B[j1] ) {
ng = true;
break;
}
}
if ( !ng ) return true;
}
}
return false;
}
int main() {
string ans = solve() ? "Yes" : "No";
cout << ans << "\n";
return 0;
} |
s758275695 | p03804 | u688375653 | 1575151636 | Python | Python (3.4.3) | py | Runtime Error | 171 | 12472 | 416 | import numpy as np
N,M = map(int, input().split())
A=[]
for i in range(N):
A.append(list(input()))
B=[]
for j in range(M):
B.append(list(input()))
A=np.asarray(A)
B=np.asarray(B)
flg=False
for x in range(N-M):
for y in range(N-M):
if (A[x:x+M,y:y+M] == B).all():
flg=True
if flg:
print("Yes")
else:
if (A == B).all():
print("Yes")
else:
print("No") |
s311809134 | p03804 | u688375653 | 1575151515 | Python | Python (3.4.3) | py | Runtime Error | 152 | 12500 | 389 | import numpy as np
N,M = map(int, input().split())
A=[]
for i in range(N):
A.append(list(input()))
B=[]
for j in range(M):
B.append(list(input()))
A=np.asarray(A)
B=np.asarray(B)
flg=False
if (A == B).all():
flg=True
for x in range(N-M):
for y in range(N-M):
if (A[x:x+M,y:y+M] == B).all():
flg=True
if flg:
print("Yes")
else:
print("No") |
s387771273 | p03804 | u088974156 | 1574834149 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 201 | m,n =map(int,input().split())
a=[input() for _ in range(m)]
b=[input() for _ in range(m)]
r=any([r[j:j+m] for r in a[i:i+m]]==b for i in range (n-m+1) for j in range(n-m+1))
print("Yes" if r else "No") |
s874262847 | p03804 | u672494157 | 1574545404 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38384 | 1094 | import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect
sys.setrecursionlimit(4100000)
def inputs(num_of_input):
ins = [input() for i in range(num_of_input)]
return ins
def int_inputs(num_of_input):
ins = [int(input()) for i in range(num_of_input)]
return ins
def is_match(parent, child, pi, pj):
for ci in range(len(child)):
for cj in range(len(child[ci])):
# c = child[ci][cj]
# p = parent[pi+ci][pj+cj]
if child[ci][cj] != parent[pi+ci][pj+cj]:
return False
return True
def solve(N, M, inputs):
map_parent = list(map(list, inputs[:N]))
map_child = list(map(list, inputs[N:]))
for pi in range(0, M):
for pj in range(0, M):
if is_match(map_parent, map_child, pi, pj):
return 'Yes'
return 'No'
def string_to_int(string):
return list(map(int, string.split()))
if __name__ == "__main__":
[N, M] = string_to_int(input())
ret = solve(N, M, inputs(N+M))
print(ret)
|
s742457962 | p03804 | u622045059 | 1574477203 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 524 | N,M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
b_index = 0
for i in range(N):
for j in range(len(A[i])):
if A[i][j] == B[0][0]:
for i2 in range(M):
for j2 in range(len(B[i2])):
if A[i+i2][j+j2] != B[i2][j2]:
break
else:
continue
break
else:
print('Yes')
exit()
print('No')
|
s982481664 | p03804 | u214434454 | 1574229336 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3060 | 409 | n , m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
#i, j はBの左端
for i in range(n-m):
ans = True
for j in range(n-m):
for k in range(m):
if a[i + k][j:j+m] != b[k]:
ans = False
if ans == True:
break
else:
continue
break
if ans == True:
print("Yes")
else:
print("No")
|
s500855170 | p03804 | u557494880 | 1573892877 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 338 | N,M = int(input())
A = []
B = []
for i in range(N):
A.append(input())
for i in range(M):
B.append(input())
for i in range(N-M+1):
for k in range(N-M+1):
p = 1
for j in range(i,i+M):
a = A[j][k:k+M]
b = B[j-i][k+M]
if a != b:
p = 0
ans += 1
print(ans) |
s850708566 | p03804 | u779455925 | 1573504246 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 26 | 4 1
....
....
....
....
#
|
s865945187 | p03804 | u276115223 | 1573497619 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 423 | # ABC 054: B – Template Matching
n, m = [int(s) for s in input().split()]
a = []
b = []
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
is_contained = 'No'
for i in range(n - m + 1):
for j in range(m - i):
if b[j] in a[j]:
if a[j].index(b[j]) != a[i].index(b[i]):
break
else:
is_contained = 'Yes'
break
print(is_contained) |
s829560868 | p03804 | u276115223 | 1573497161 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 435 | # ABC 054: B – Template Matching
n, m = [int(s) for s in input().split()]
a = []
b = []
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
is_contained = 'No'
for i in range(n - m + 1):
if b[0] in a[i]:
for j in range(m - i):
if a[j].index(b[j]) != a[i].index(b[i]):
break
else:
is_contained = 'Yes'
break
print(is_contained) |
s104054555 | p03804 | u254871849 | 1572449090 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1060 | n, m = [int(x) for x in input().split()]
img_a = [input() for _ in range(n)]
img_b = [input() for _ in range(m)]
found = False
for a in range(n - m + 1):
border = 0
isok = True
while isok and not flag:
for b in range(m):
if img_b[b] in img_a[b+a][border:]:
if b == 0:
index = img_a[a].index(img_b[0], border)
current_index = img_a[b+a].index(img_b[b], border)
if current_index == index:
continue
elif current_index > index:
border = current_index
break
else:
border = index
break
else: # if not substring in string.
isok = False
break
else: # if not loop broken.
ans = "Yes"
found = True
break
if found:
break
else: # if not 'found==True' even after last loop, then it means B is not in A.
ans = "No"
print(ans) |
s198967560 | p03804 | u254871849 | 1572414130 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1060 | n, m = [int(x) for x in input().split()]
img_a = []
img_b = []
for i in range(n):
img_a.append(input())
for i in range(m):
img_b.append(input())
ans = "No"
for a in range(n - m + 1):
dup_a = img_a.copy()
dup_b = img_b.copy()
flag = True
while flag:
for b in range(m):
if dup_b[b] in dup_a[b+a]:
if b == 0:
index = dup_a[a].index(dup_b[0])
current_index = dup_a[b+a].index(dup_b[b])
if current_index != index:
if current_index > index:
for line in dup_a:
del line[:current_index]
break
else:
for line in dup_a:
del line[:index]
break
else: # if not substring in string.
flag = False
break
else: # if not for loop broken.
ans = "Yes"
break
print(ans) |
s365062945 | p03804 | u254871849 | 1572413669 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1039 | n, m = [int(x) for x in input().split()]
img_a = []
img_b = []
for i in range(n):
img_a.append(input())
for i in range(m):
img_b.append(input())
ans = "No"
for a in range(n - m + 1):
dup_a = img_a.copy()
dup_b = img_b.copy()
flag = True
while flag:
for b in range(m):
if dup_b[b] in dup_a[b+a]:
if b == 0:
index = dup_a[a].index(dup_b[0])
current_index = dup_a[b+a].index(dup_b[b])
if current_index == index:
continue
elif current_index > index:
for line in dup_a:
del line[:current_index]
break
else:
for line in dup_a:
del line[:index]
break
else: # if not substring in string.
flag = False
break
else: # if not loop broken.
ans = "Yes"
break
print(ans) |
s458141291 | p03804 | u254871849 | 1572413452 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1046 | n, m = [int(x) for x in input().split()]
img_a = []
img_b = []
for i in range(n):
img_a.append(input())
for i in range(m):
img_b.append(input())
ans = "No"
for a in range(n - m + 1):
dup_a = img_a.copy()
dup_b = img_b.copy()
while True:
for b in range(m):
if dup_b[b] in dup_a[b+a]:
if b == 0:
index = dup_a[a].index(dup_b[0])
current_index = dup_a[b+a].index(dup_b[b])
if current_index == index:
continue
elif current_index > index:
for line in dup_a:
del line[:current_index]
break
else:
for line in dup_a:
del line[:index]
break
else: # if not substring in string.
break
if not dup_b[b] in dup_a[b+a]:
break
# if not loop broken.
ans = "Yes"
break
print(ans) |
s744120026 | p03804 | u254871849 | 1572412673 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1023 | n, m = [int(x) for x in input().split()]
img_a = []
img_b = []
for i in range(n):
img_a.append(input())
for i in range(m):
img_b.append(input())
ans = "No"
for a in range(n - m + 1):
dup_a = img_a.copy()
dup_b = img_b.copy()
while True:
for b in range(m):
if dup_b[b] in dup_a[b+a]:
if b == 0:
index = dup_a[a].index(dup_b[0])
current_index = dup_a[b+a].index(dup_b[b])
if current_index > index:
for line in dup_a:
del line[:current_index]
break
elif current_index < index:
for line in dup_a:
del line[:index]
break
else: # if not substring in string.
break
else: # if not loop broken.
ans = "Yes"
break
if not dup_b[b] in dup_a[b+a]:
break
print(ans) |
s878851720 | p03804 | u254871849 | 1572412614 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1018 | n, m = [int(x) for x in input().split()]
img_a = []
img_b = []
for i in range(n):
img_a.append(input())
for i in range(m):
img_b.append(input())
ans = "No"
for a in range(n - m + 1):
dup_a = img_a.copy()
dup_b = img_b.copy()
while True:
for b in range(m):
if dup_b[b] in dup_a[b+a]:
if b == 0:
index = dup_a[a].index(dup_b[0])
current_index = dup_a[b+a].index(dup_b[b])
if current_index > index:
for line in dup_a:
del line[:current_index]
break
elif current_index < index:
for line in dup_a:
del line[:index]
break
else: # if not substring in string.
break
else: # if not loop broken.
ans = "Yes"
break
if not dup_b[b] in dup_a:
break
print(ans) |
s590666038 | p03804 | u254871849 | 1572412048 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 966 | n, m = [int(x) for x in input().split()]
img_a = []
img_b = []
for i in range(n):
img_a.append(input())
for i in range(m):
img_b.append(input())
ans = "No"
for a in range(n - m + 1):
dup_a = img_a.copy()
dup_b = img_b.copy()
while True:
for b in range(m):
if dup_b[b] in dup_a[b+a]:
if b == 0:
index = dup_a[a].index(dup_b[0])
current_index = dup_a[b+a].index(dup_b[b])
if current_index > index:
for line in dup_a:
del line[:current_index]
break
elif current_index < index:
for line in dup_a:
del line[:index]
break
else: # if not substring in string.
break
else: # if not loop broken.
ans = "Yes"
break
print(ans) |
s309471651 | p03804 | u153902122 | 1571033833 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 374 | import sys
N, M = map(int,input().split())
A,B=[],[]
for i in range(N):
array = list(input().split())
A.append(array)
for j in range(M):
array = input().split()
B.append(array)
for i in range(N-M+1):
for j in range(N-M+1):
new = [A[k][j:j+M] for k in range(i,i+M)]
if new == b:
print('Yes')
sys.exit()
print('No') |
s737806268 | p03804 | u790710233 | 1570650650 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 347 | n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
tmp = []
for k in range(n):
for i in range(n):
if i+m <= n:
for j in range(m):
tmp.append(a[k+j][i:i+m])
if tmp == b:
print('Yes')
exit()
tmp = []
else:
print('No')
|
s194162671 | p03804 | u681917640 | 1570643156 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 387 | N, M = map(int, input().split())
A = [ input() for _ in range(N) ]
B = [ input() for _ in range(M) ]
for i in range(N-M+1):
for _ in range(A[i].count(B[0])):
l = A[i].index(B[0], l)
result = True
for k in range(1, M):
if B[k] != A[i+k][l:l+len(B[k])]:
result = False
break
if result:
print("Yes")
exit()
l += 1
print("No") |
s158504341 | p03804 | u062484507 | 1569014562 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 314 | N, M = map(int, input().split())
A = [input() for i in range(N)]
B = [input() for i in range(M)]
ans = 'No'
for i in range(N):
if A[i].find(B[0]) > -1:
x = A[i].find(B[0])
y = i + 1
ans = 'Yes'
break
for j in range(1, M):
if B[j] != A[y][x:M]:
ans = 'No'
print(ans) |
s172801799 | p03804 | u010437136 | 1568847879 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 622 | import io
sys.stdin = io.StringIO("""3 2
#.#
.#.
#.#
#.
.#
""")
import sys
def main():
t = sys.stdin.readline()
t1 = t.rstrip()
t2 = t1.split(' ')
stra = []
for i in range(int(t2[0])):
y = sys.stdin.readline()
t = y.rstrip()
stra += [t]
strb = []
for i in range(int(t2[1])):
y = sys.stdin.readline()
t = y.rstrip()
strb += [t]
suma = 0
for x in strb:
for y in stra:
print(x,y)
if x in y:
suma +=1
if int(t2[0])*int(t2[1])==suma:
print("yes")
print(stra,strb)
main() |
s657443752 | p03804 | u263347388 | 1568847731 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 188 | first=input()
(N, M)=first.split()
N=int(N)
M=int(M)
for A in range(N):
input()
int(A)
for B in range(5-N):
input()
int(B)
if B in A:
print("Yes")
else:
print("No") |
s285446937 | p03804 | u152638361 | 1568638302 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 316 | N, M = map(int,input().split())
A = [input() for i in range(N)]
B = [input() for i in range(M)]
flg = 0
for dx in range(N-M):
for dy in range(N-M):
# print(A[dy][dx:N-1-dx],B[dy])
if all(A[i+dy][dx:N-1-dx]==B[i+dy] for i in range(M)):
flg =1
if flg == 1: print("Yes")
else: print("No") |
s091730530 | p03804 | u407016024 | 1568451721 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 446 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for i in range(N-M+1):
for j in range(N-M+1):
cnt = 0
for k in range(i,i+M): # yoko
for l in range(j,j+M): # tate
if A[k][l]!=B[k][l]:
break
else:
cnt+=1
if cnt == M*M:
print('Yes')
exit()
print('No') |
s458905369 | p03804 | u600402037 | 1568311500 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 393 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
flag = 'No'
for i in range(N-M):
for j in range(N-M):
check = []
for k in range(M):
if A[i+k][j:j+M] == B[i+k]:
check.append(1)
else:
check.append(-1)
if sum(check) == M:
flag = 'Yes'
print(flag)
|
s855796310 | p03804 | u033606236 | 1568231281 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 269 | n, m = map(int,input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
flag = 0
for i in range(n-m+1):
for j in range(n-m+1):
if a[i][j:j+m] == b[0] and a[i+1][j:j+m] == b[1]:
flag = 1
print("Yes" if flag == 1 else "No") |
s435434839 | p03804 | u033606236 | 1568231276 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 280 | n, m = map(int,input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
print(a,b)
flag = 0
for i in range(n-m+1):
for j in range(n-m+1):
if a[i][j:j+m] == b[0] and a[i+1][j:j+m] == b[1]:
flag = 1
print("Yes" if flag == 1 else "No") |
s229434071 | p03804 | u033606236 | 1568231128 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 269 | n, m = map(int,input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
flag = 0
for i in range(n-m+1):
for j in range(n-m+1):
if a[i][i:i+m] == b[0] and a[i+1][i:i+m] == b[1]:
flag = 1
print("Yes" if flag == 1 else "No") |
s362047915 | p03804 | u521866787 | 1567797945 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 429 | h, w = map(int,(input().split()))
a=[]
b=[]
for i in range(h):
a.append(input())
for i in range(w):
b.append(input())
ans='No'
for i in range(h):
if a[i].find(b[0]) >0:
l= a[i].find(b[0])
for k in range(1,w):
print(a[i+k][l:len(b[0])+1])
print(b[k])
if a[i+k][l:len(b[0])+1]==b[k]:
ans='Yes'
else:
ans='No'
print(ans) |
s061072848 | p03804 | u814986259 | 1567510135 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 370 | N,M=map(int,input.split())
A=[""]*N
B=[""]*M
for i in range(N):
A[i]=input()
for i in range(M):
B[i]=input()
for i in range(N-M):
if B[0] in A[i]:
for j in range(1,M):
if B[j] in A[i+j]:
if j = M - 1:
print("Yes")
exit(0)
else:
continue
else:
break
print("No") |
s023063773 | p03804 | u814986259 | 1567509998 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 377 | N,M=map(int,input.split())
A=[""]*N
B=[""]*M
for i in range(N):
A[i]=input()
for i in range(M):
B[i]=input()
flag=False
for i in range(N-M)
if B[0] in A[i]:
for j in range(1,M):
if B[j] in A[i+j]:
if j = M - 1:
print("Yes")
exit(0)
else:
continue
else:
break
print("No") |
s080032001 | p03804 | u433532588 | 1567198413 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1 | x |
s047192937 | p03804 | u734876600 | 1567035424 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 489 | n,m = map(int,input().split())
a = []
b = []
fl = False
for i in range(n):
a.append(list(input()))
for i in range(m):
b.append(list(input()))
for i in range(n - m + 1):
if b[0] in a[i]:
tmp = a[i].find(b[0])
if m == 1:
fl = True
for j in range(1,m):
if a[i+j][tmp:tmp+m] != b[j]:
fl = False
break
fl = True
if fl:
break
if fl:
print("Yes")
else:
print("No") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.