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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s504147354 | p03804 | u312025627 | 1566826959 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 39152 | 625 | def main():
n, m = (int(i) for i in input().split())
a = [input() for i in range(n)]
b = [input() for i in range(m)]
equal_flag = False
k = 0
for i in range(n):
for j in range(n-m+1):
if a[i][j:j+m] == b[k]:
plus = 1
while k+plus != m:
if a[i+plus][j:j+m] != b[k+plus]:
break
plus += 1
else:
equal_flag = True
if equal_flag:
print("Yes")
break
else:
print("No")
if __name__ == '__main__':
main() |
s604573449 | p03804 | u027929618 | 1566771673 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 285 | 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):
ok = True
if A[i + j][j:j + M] != B[k]:
ok = False
break
if ok:
print("Yes")
exit()
print("No") |
s626190580 | p03804 | u027929618 | 1566771544 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 285 | 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):
ok = True
if A[i + k][j:j + M] != B[k]:
ok = False
break
if ok:
print("Yes")
exit()
print("No") |
s299948117 | p03804 | u989345508 | 1566746050 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 471 | n,m=input().split()
n,m=int(n),int(m)
a=[]
for i in range(n):
a.append(input())
b=[]
for i in range(m):
b.append(input())
#貪欲にやれドアホ
for i in range(n-m):
for j in range(n-m):
c=0
for k in range(m):
if b[k] == a[i+k][j:j+m]:
c+=1
else:
break
if c==m:
break
if c==m:
break
if c==m or (n==m and a==b):
print("Yes")
else:
print("No")
|
s930382307 | p03804 | u989345508 | 1566745915 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 452 | n,m=input().split()
n,m=int(n),int(m)
a=[]
for i in range(n):
a.append(input())
b=[]
for i in range(m):
b.append(input())
#貪欲にやれドアホ
for i in range(n-m):
for j in range(n-m):
c=0
for k in range(m):
if b[k] == a[i+k][j:j+m]:
c+=1
else:
break
if c==m:
break
if c==m:
break
if c==m:
print("Yes")
else:
print("No")
|
s409182521 | p03804 | u430223993 | 1566067063 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 769 | import sys
n, m = map(int, input().split())
A = [input() for _ in range(n)]
B = [input() for _ in range(m)]
count = 0
idx = 0
position = []
for b in B:
if idx == 0:
for i, a in enumerate(A[:-m]):
if b in a:
position.append(a.find(b))
if a.count(b) > 1:
position.append(a.rfind())
position.append(a.find(b, a.find(b)))
count += 1
idx = i
break
if count == 0:
print('No')
sys.exit()
else:
for i, a in enumerate(A[idx+1:]):
for p in position:
if b == a[p:p + m]:
break
print('No')
sys.exit()
print('Yes') |
s296453436 | p03804 | u430223993 | 1566066577 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 713 | import sys
n, m = map(int, input().split())
A = [input() for _ in range(n)]
B = [input() for _ in range(m)]
count = 0
idx = 0
position = []
for b in B:
if idx == 0:
for i, a in enumerate(A[:-m]):
if b in a:
position.append(a.find(b))
if a.count(b) > 1:
position.append(a.rfind())
count += 1
idx = i
break
if count == 0:
print('No')
sys.exit()
else:
for i, a in enumerate(A[idx+1:-m]):
for p in position:
if b == a[p:p + m]:
break
print('No')
sys.exit()
print('Yes') |
s448960435 | p03804 | u952022797 | 1565964934 | Python | PyPy3 (2.4.0) | py | Runtime Error | 184 | 38640 | 1740 | # -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def main():
N,M = inputMap()
A = []
for i in range(N):
tmp = input()
A.append(tmp)
B = []
for i in range(M):
tmp = input()
B.append(tmp)
if N < M:
print("No")
sys.exit()
if N == M:
tmp1 = "".join(A)
tmp2 = "".join(B)
if tmp1 == tmp2:
print("Yes")
else:
print("No")
sys,exit()
points = []
AA = copy.deepcopy(A)
for i,val in enumerate(AA):
while True:
tmp = run(val, B[0])
if tmp != -1:
points.append((i,tmp))
valval = list(copy.deepcopy(val))
valval[tmp] = "T"
val = "".join(valval)
else:
break
for i in points:
lines, point = i
flg = True
for j,val in enumerate(B):
tmp = A[lines+j].find(val)
if tmp == -1:
flg = False
if flg == True:
print("Yes")
sys.exit()
print("No")
def run(ss, dd):
return ss.find(dd)
if __name__ == "__main__":
main()
|
s712521752 | p03804 | u889344512 | 1565394828 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 39408 | 395 | n,m = map(int,input().split())
a = []
for i in range(n):
a.append(input())
b = []
for i in range(m):
b.append(input())
ans = "No"
for x in range(0,n-m):
for y in range(0,n-m):
bina = True
for i in range(m):
for j in range(m):
if a[i][j] != b[x+i][y+j]:
bina = False
if bina:
ans = "Yes"
print(ans) |
s195289111 | p03804 | u736729525 | 1565212848 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 359 | N, M = [int(x) for x in input().split()]
A = [None]*N
for i in range(N):
A[i] = input()
B = [None]*M
for i in range(M):
B[i] = input()
def check():
for x in range(N-M+1):
for y in range(N-M+1):
if all(all(A[r+x][c+y] == B[r][c] for c in range(M)) for r range(M))
return "Yes"
return "No"
print(check())
|
s939736312 | p03804 | u385309449 | 1565206189 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 242 | n,m = map(int,input().split())
a = [input() for i in range(n)]
b = [input() for i in range(m)]
for i in range(m):
for j in range(m):
if a[i][j] == b[i][j]:
pass
else:
a = []
if a == []:
print('No')
else:
print('Yes') |
s678324075 | p03804 | u360116509 | 1564947534 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 533 | def main():
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):
f = True
for k in range(M):
for l in range(M):
if A[i + k][j + l] != B[k][l]:
f = False
break
if f is False:
break
if f is True:
print('Yes')
exit()
print('No')
main()
|
s164867924 | p03804 | u897328029 | 1564937738 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 975 | n, m = list(map(int, input().split()))
a_list_list = []
for i in range(0, n):
a_list_list.append(input().split()[0])
b_list_list = []
for i in range(0, m):
b_list_list.append(input().split()[0])
def is_match(source_list_list, b_list_list, source_start_x):
for k in range(len(b_list_list)):
for l in range(len(b_list_list[0])):
if source_list_list[k][source_start_x + l] != b_list_list[k][l]:
return False
return True
# def debug_print(source):
# print('==============')
# for row in source:
# print(row)
# print('==============')
is_ok = False
# debug_print(b_list_list)
for j, _ in enumerate(a_list_list):
target_a_list_list = a_list_list[j:j+m]
for i in range(0, n-m):
# debug_print(target_a_list_list)
if is_match(target_a_list_list, b_list_list, i):
is_ok = True
break
if is_ok:
break
ans = 'Yes' if is_ok else 'No'
print(ans) |
s195393147 | p03804 | u369338402 | 1564362803 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 419 | n,m=map(int,input().split())
a=[]
b=[]
for i in range(n):
a.append(input())
for j in range(m):
b.append(input())n,m=map(int,input().split())
a=[]
b=[]
l=0
k=0
temp=[]
res=False
for i in range(n):
a.append(input())
for j in range(m):
b.append(input())
#print(a)
while k<=n-m+1:
while l+m<=n:
for o in range(m):
temp.append(a[o+k][l:l+m])
print(o,m,k)
l+=1
print(temp)
temp=[]
k+=1 |
s349334930 | p03804 | u794753968 | 1564272959 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 372 | N, M = map(int, input().split())
a = []
for x in range(0, N):
a.append(input())
b = []
for x in range(0, M):
b.append(input())
for i in range(0, len(a)):
found = a[i].find(b[0])
if found != -1:
tmp = []
for j in range(i, len(b)+1):
tmp.append(a[j][found:found+M])
if "".join(tmp) == "".join(b):
print("Yes")
exit()
print("No")
|
s184905849 | p03804 | u450904670 | 1564271948 | Python | PyPy3 (2.4.0) | py | Runtime Error | 183 | 38768 | 327 | import numpy as np
n,m = list(map(int, input().split()))
tmp_a = [list(input()) for _ in range(n)]
tmp_b = [list(input()) for _ in range(m)]
a = np.array(tmp_a)
b = np.array(tmp_b)
for a_i in range(n - m + 1):
for a_j in range(n - m + 1):
if((a[a_i:a_i + m, a_j:a_j + m] == b).all()):
print("Yes")
exit()
print("No") |
s769126544 | p03804 | u450904670 | 1564271899 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 38512 | 354 | import numpy as np
n,m = list(map(int, input().split()))
tmp_a = [list(input()) for _ in range(n)]
tmp_b = [list(input()) for _ in range(m)]
a = np.array(tmp_a)
b = np.array(tmp_b)
for a_i in range(n - m + 1):
for a_j in range(n - m + 1):
if((a[a_i:a_i + m, a_j:a_j + m] == b).all()):
print("Yes")
exit()
print("No") |
s007787533 | p03804 | u450904670 | 1564271863 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38384 | 350 | import numpy as np
n,m = list(map(int, input().split()))
tmp_a = [list(input()) for _ in range(n)]
tmp_b = [list(input()) for _ in range(m)]
a = np.array(tmp_a)
b = np.array(tmp_b)
for a_i in range(n - m + 1):
for a_j in range(n - m + 1):
if((a[a_i:a_i + m, a_j:a_j + m] == b).all()):
print("Yes")
exit()
print("No") |
s782790834 | p03804 | u450904670 | 1564271831 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 342 | import numpy as np
n,m = list(map(int, input().split()))
tmp_a = [list(input()) for _ in range(n)]
tmp_b = [list(input()) for _ in range(m)]
a = np.array(tmp_a)
b = np.array(tmp_b)
for a_i in range(n - m + 1):
for a_j in range(n - m + 1):
if((a[a_i:a_i + m, a_j:a_j + m] == b).all()):
print("Yes")
exit()
print("No") |
s841477336 | p03804 | u733814820 | 1564271598 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 725 | # ABC 054 B
import sys
N, M = map(int, input().split())
A = [input() for i in range(N)]
B = [input() for i in range(M)]
ret = [[] for i in range(M)]
for i in range(len(B)):
for j in range(len(A)):
f = -1
while True:
f = A[j].find(B[i], f+1)
if f == -1:
break
ret[i].append((j, f))
flag = False
# ret = [[(1, 1)],
# [(1, 1), (2, 1)]]
if M == 1 and len(ret[0] > 0):
print('True')
sys.exit(0)
for i in range(len(ret[0])):
start = ret[0][i] # (x, y)
for j in range(M-1):
if not (start[0]+1, start[1]) in ret[j+1]:
break
if j == M-2:
print('Yes')
sys.exit(0)
print('No')
|
s136167404 | p03804 | u652057333 | 1564211888 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 548 | n, m = map(int, input().split())
a = []
b = []
for i in range(n):
a.append(list(input()))
for i in range(m):
b.append(list(input()))
for s_h in range(n - m):
for s_w in range(n - m):
flag = True
for i in range(m):
for j in range(m):
if a[s_h + i][s_w + j] != b[i][j]:
flag = False
break
if not flag:
break
if flag:
print("Yes")
break
if flag:
break
if not flag:
print("No") |
s518237596 | p03804 | u668503853 | 1564179467 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 342 | N,M=map(int,input().split())
A=[input() for _ in range(N)]
B=[input() for _ in range(M)]
ans="No"
for i in range(N-M+1):
for j in range(len(A[0])-len(B[0])+1):
t = 0
for k in range(len(B[0])):
for l in range(M):
if A[k+q][l+p] == B[q][p]:
t += 1
if t==len(B[0])*M:
ans="Yes"
exit()
print(ans) |
s522816441 | p03804 | u668503853 | 1564177573 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 341 | N,M=map(int,input().split())
A=[input() for _ in range(N)]
B=[input() for _ in range(M)]
ans="No"
for i in range(N-M+1):
for j in range(len(A[0])-len(B[0])+1):
t = 0
for k in range(len(B[0])):
for l in range(M):
if A[k+q][l+p] == B[q][p]:
t += 1
if t==len(B[0])*M:
ans="Yes"
break
print(ans) |
s750719488 | p03804 | u759412327 | 1564088984 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 290 | import numpy as np
N,M = map(int,input().split())
A = np.array([list(input()) for i in range(N)])
B = np.array([list(input()) for i in range(M)])
f = 0
for i in range(N-M+1):
for j in range(N-M+1):
if (A[i:i+M,j:j+M]==B).all():
f = 1
if f:
print("Yes"):
else:
print("No") |
s248694976 | p03804 | u371409687 | 1563925738 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 240 | n,m=map(int,input().split())
i1=[input() for _ in range(n)]
i2=[input() for _ in range(m)]
ans="No"
for i in range(n-m+1):
for j in range(n-m+1):
if i1[i][j:m+j]==i2[0] and i1[i+1][j:j+m]==i2[1]:
ans="Yes"
print(ans) |
s897269574 | p03804 | u371409687 | 1563925607 | Python | PyPy3 (2.4.0) | py | Runtime Error | 190 | 38512 | 240 | n,m=map(int,input().split())
i1=[input() for _ in range(n)]
i2=[input() for _ in range(m)]
ans="No"
for i in range(n-m+1):
for j in range(n-m+1):
if i1[i][j:m+j]==i2[0] and i1[i+1][j:j+m]==i2[1]:
ans="Yes"
print(ans) |
s747316460 | p03804 | u423585790 | 1563568346 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 1962 | \#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#A
def A():
a, b = LI()
a -= 2
b -= 2
a %= 13
b %= 13
if a > b:
print("Alice")
elif a < b:
print("Bob")
else:
print("Draw")
return
#B
def B():
n, m = LI()
a = SR(n)
b = SR(m)
if a == b:
print("Yes")
return
for y in range(n - m):
for x in range(n - m):
if a[y][x] == b[0][0]:
flg = 0
for yi in range(m):
for xi in range(m):
if b[yi][xi] == a[y + yi][x + xi]:
continue
flg = 1
break
if flg:
break
if flg:
continue
print("Yes")
return
print("No")
return
#C
def C():
return
#D
def D():
return
#Solve
if __name__ == '__main__':
B()
|
s809718503 | p03804 | u537782349 | 1563561756 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 492 | a, b = map(int, input().split())
c = []
d = []
for i in range(a):
c.append(list(input()))
for i in range(b):
d.append(list(input()))
for i in range(a-b+1):
for j in range(a-b+1):
m = n = 0
o = True
for k in range(i,i+b):
n = 0
for l in range(k, k+b):
if c[k][l] != d[m][n]:
o = not o
n += 1
m += 1
if o:
print("Yes")
exit()
print("No")
|
s582856217 | p03804 | u537782349 | 1563242015 | Python | Python (3.4.3) | py | Runtime Error | 129 | 3444 | 338 | a, b = map(int, input().split())
c = []
d = ""
for i in range(a):
c.append(list(input()))
for i in range(b):
d += input()
e = []
for i in range(b):
for j in range(b):
f = ""
for k in range(b):
for l in range(b):
f += c[i+k][j+l]
e.append(f)
print("Yes" if d in e else "No")
|
s123285962 | p03804 | u346395915 | 1563150429 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 343 | n,m = map(int,input().split())
li_a = [list(input()) for _ in range(n)]
li_b = [list(input()) for _ in range(m)]
for i in range(n-m+1):
for j in range(n-m+1):
for k in range(m):
if li_a[i+x][j:j+m] != li_b[x][:]:
break
else:
print("Yes")
exit()
print("No") |
s179879291 | p03804 | u373499377 | 1562513429 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 582 | def main():
n, m = map(int, input().split())
a = [input() for i in range(n)]
b = [input() for i in range(m)]
for row in range(n - m + 1):
current_index = 0
for index in range(m - 1):
current_index = a[row].find(b[row], index)
if current_index < 0:
break
for i in range(m - 1):
if a[row + i].find(b[row + i]) != current_index:
break
else:
print('Yes')
return
print('No')
if __name__ == "__main__":
main()
|
s472690669 | p03804 | u373499377 | 1562512794 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 571 | def main():
n, m = map(int, input().split())
a = [input() for i in range(n)]
b = [input() for i in range(m)]
for row in range(n - m):
current_index = 0
for index in range(m - 1):
current_index = a[row].find(b[row], index)
if current_index < 0:
break
for i in range(row, n - m):
if a[i].find(b[i]) != current_index:
break
else:
print('Yes')
return
print('No')
if __name__ == "__main__":
main()
|
s941381715 | p03804 | u373499377 | 1562512571 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 571 | def main():
n, m = map(int, input().split())
a = [input() for i in range(n)]
b = [input() for i in range(m)]
for row in range(n - m):
current_index = 0
for index in range(n - m):
current_index = a[row].find(b[row], index)
if current_index < 0:
break
for i in range(row, n - m):
if a[i].find(b[i]) != current_index:
break
else:
print('Yes')
return
print('No')
if __name__ == "__main__":
main()
|
s140085886 | p03804 | u373499377 | 1562512297 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 575 | def main():
n, m = map(int, input().split())
a = [input() for i in range(n)]
b = [input() for i in range(m)]
for row in range(n - m):
current_index = 0
for index in range(n - m):
current_index = a[row].find(b[row], index)
if current_index < 0:
break
for i in range(row + 1, n - m):
if a[i].find(b[i]) != current_index:
break
else:
print('Yes')
return
print('No')
if __name__ == "__main__":
main()
|
s605465886 | p03804 | u539517139 | 1562464514 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 341 | n,m=map(int,input().split())
x='No'
a=[input() for _ in range(n)]
b=[input() for _ in range(m)]
def c(i,j):
global m,global a, global b
for k in range(m):
for l in range(m):
if b[k][l]!=a[i+k][j+l]:
return 0
return 1
for i in range(n-m+1):
for j in range(n-m+1):
if c(i,j)==1:
x='Yes'
break
print(x) |
s856678867 | p03804 | u463655976 | 1562323958 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 544 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
char A[50][50], B[50][50];
for(int i=0; i<N; ++i) scanf("%s", &A[i][0]);
for(int i=0; i<M; ++i) scanf("%s", &B[i][0]);
for(int Ay=0; Ay<=N-M; ++Ay)for(int Ax=0; Ax<=N-M; ++Ax)
if([&](int x, int y){
for(int i = 0, j = 0; i < M; i+= j >= M ? j=0,1 :j++,0)
if(A[x+i][y+j] != B[i][j]) return 0;
return 1;
}(Ax, Ay))
{
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
|
s714221317 | p03804 | u463655976 | 1562291254 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 340 | N, M = map(int, input().split())
A = [list(map(int, input())) for _ in range(N)]
B = [list(map(int, input())) for _ in range(M)]
def func():
for i in range(N-M):
for j in range(N-M):
if all(A[i+k][j+l] == B[k][l] for k in range(M) for l in range(M)):
return True
return False
print("Yes" if func() else "No")
|
s600899812 | p03804 | u298297089 | 1561151743 | Python | Python (3.4.3) | py | Runtime Error | 149 | 12508 | 314 | import numpy as np
N,M = map(int, input().split())
A = []
for i in range(N):
A.append(input())
B = []
for i in range(M):
M.append(input())
A = np.array(A)
B = np.array(B)
for i in range(N-M):
for j in range(N-M):
if A[i:i+M][j:j+M] == B:
print('Yes')
exit()
print('No') |
s543088504 | p03804 | u298297089 | 1561151728 | Python | Python (3.4.3) | py | Runtime Error | 149 | 12508 | 314 | import numpy as np
N,M = map(int, input().split())
A = []
for i in range(N):
A.append(input())
B = []
for i in range(M):
M.append(input())
A = np.array(A)
B = np.array(B)
for i in range(N-M):
for j in range(N-M):
if A[i:i+M, j:j+M] == B:
print('Yes')
exit()
print('No') |
s374483143 | p03804 | u073549161 | 1560486690 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 536 | n, m = map(int, input().split())
dat_a = []
dat_b = []
for i in range(n):
dat_a.append(input())
for i in range(m):
dat_b.append(input())
for i in range(n - m):
for j in range(n - m + 1):
t = True
for k in range(m):
#print(dat_a[i + k][j:j+m])
#print(dat_b[k])
if dat_a[i + k][j:j+m] != dat_b[k]:
t = False
continue
if t:
break
if t:
break
if t:
break
print("Yes" if t else "No") |
s889173712 | p03804 | u073549161 | 1560485849 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 418 | n, m = map(int, input().split())
dat_a = []
dat_b = []
for i in range(n):
dat_a.append(input())
for i in range(m):
dat_b.append(input())
for i in range(n - m):
t = True
for j in range(n - m):
for k in range(m):
if dat_a[i+ k][j:j+m] != dat_b[k]:
t = False
continue
if t:
break
if t:
break
print("Yes" if t else "No") |
s753557134 | p03804 | u073549161 | 1560485769 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 385 | n, m = map(int, input().split())
dat_a = []
dat_b = []
for i in range(n):
dat_a.append(input())
for i in range(m):
dat_b.append(input())
for i in range(n - m):
t = True
for j in range(n - m):
for k in range(m):
if dat_a[i+ k][j:j+m] != dat_b[k]:
t = False
continue
if t:
break
print("Yes" if t else "No") |
s473576061 | p03804 | u073549161 | 1560485612 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 482 | n, m = map(int, input().split())
dat_a = []
dat_b = []
for i in range(n):
dat_a.append(input())
for i in range(m):
dat_b.append(input())
for i in range(n - m):
t = True
for j in range(n - m):
for k in range(m):
#print(dat_a[i + k][j:j+m])
#print(dat_b[k])
if dat_a[i+ k][j:j+m] != dat_b[k]:
t = False
break
if t:
break
if t:
break
print("Yes" if t else "No") |
s005426253 | p03804 | u483640741 | 1560195867 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 498 | n,m=map(int,input().split())
pic1=[]
pic2=[]
for i in range(n):
pic1.append(input())
for j in range(m):
pic2.append(input())
#print(pic1)
#print(pic2)
ans="No"
for i in range(n-m+1):
for j in range(n-m+1):
flag=True
for k in range(m):
for l in range(m):
if pic1[i+k][j+l]!=b[k][l]:
flag=False
if not flag:
break
if flag:
print("Yes")
exit()
print("No")
|
s871058625 | p03804 | u929569377 | 1560107325 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 533 | #include<iostream>
#include <string>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
string A[55];
string B[55];
for(int i = 0; i < N; i++){
cin >> A[i];
}
for(int j = 0; j < M; j++){
cin >> B[j];
}
bool judge = false;
for(int i = 0; i < N - M + 1; i++){
for(int j = 0; j < N - M + 1; j++){
for(int k = 0; k < M; k++){
if(B[k] != A[i + k].substr(j, M)){
break;
}
if(k == M - 1){
judge = true;
}
}
}
}
if(judge){
cout << "Yes";
}
else {
cout << "No";
}
}
|
s994113877 | p03804 | u919633157 | 1560004683 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 298 | n,m=map(int,input().split())
a=[input() for _ in range(n)]
b=[input() for _ in range(m)]
ans='No'
for i in range(n-m+1):
for j in range(n-m+1):
if a[i][j]==b[0][0] and a[i][j+1]==b[0][1] and a[i+1][j]==b[1][0] and a[i+1][j+1]==b[1][1]:
ans='Yes'
break
print(ans) |
s570349100 | p03804 | u778814286 | 1559868235 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 476 | N, M = map(int,input().split())
tg = [input() for _ in range(N)]
#tmpl0〜M-1
tmpl = [input() for _ in range(M)]
#tg0〜N-Mにつき、tmpl0を探し、一致したら同じ添字のtmpl1~M-1を探す
for i in range(0,N-M+1):
for j in range(0,N-M+1):
if tmpl[0] == tg[i][j:j+M]:
if N == 1:
print('Yes')
exit()
for k in range(i+1,i+M):
if tmpl[k] != tg[i+k][j:j+M]: break
else:
print('Yes')
exit()
print('No')
|
s158311936 | p03804 | u778814286 | 1559867844 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 423 | N, M = map(int,input().split())
tg = [input() for _ in range(N)]
#tmpl0〜M-1
tmpl = [input() for _ in range(M)]
#tg0〜N-Mにつき、tmpl0を探し、一致したら同じ添字のtmpl1~M-1を探す
for i in range(0,N-M+1):
for j in range(0,N-M+1):
if tmpl[0] == tg[i][j:j+M]:
for k in range(i+1,i+M):
if tmpl[k] != tg[i+k][j:j+M]: break
else:
print('Yes')
exit()
print('No')
|
s994638011 | p03804 | u778814286 | 1559867672 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 468 | N, M = map(int,input().split())
tg = [list(map(int,input().split())) for _ in range(N)]
#tmpl0〜M-1
tmpl = [list(map(int,input().split())) for _ in range(M)]
#tg0〜N-Mにつき、tmpl0を探し、一致したら同じ添字のtmpl1~M-1を探す
for i in range(0,N-M+1):
for j in range(0,N-M+1):
if tmpl[0] == tg[i][j:j+M]:
for k in range(i+1,i+M):
if tmpl[k] != tg[i+k][j:j+M]: break
else:
print('Yes')
exit()
print('No') |
s363137745 | p03804 | u687044304 | 1559672437 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 795 | # -*- coding:utf-8 -*-
def solve():
N, M = list(map(int, input().split()))
A = []
B = []
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):
for j in range(N-M+1):
if A[i][j] == B[0][0]:
is_contained = True
for k in range(i, i+M):
for l in range(j, j+M):
if A[k][l] != B[k][l]:
is_contained = False
break
if not is_contained: break
if is_contained:
print("Yes")
return
print("No")
if __name__ == "__main__":
solve()
|
s454980434 | p03804 | u767664985 | 1559307637 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 400 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for i in range(min(N - M + 2, N)):
for j in range(min(N - M + 2, N)):
# print("i=", i, "j=", j)
if A[i][j: j + M] == B[0]:
for k in range(1, M):
tmp = True
if A[i + k][j: j + M] == B[k]:
pass
else:
tmp = False
break
if tmp:
print("Yes")
exit()
print("No")
|
s654905280 | p03804 | u129836004 | 1558538745 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 499 | N , M = map(int, input().split())
As =[input() for _ in range(N)]
Bs =[input() for _ in range(M)]
m = N-M
for i in range(m):
for j in range(m):
flag = True
for k in range(M):
for l in range(M):
if As[k+i][l+j] != Bs[k][l]:
flag = False
break
if not flag:
break
if flag:
break
if flag:
break
if flag:
print('Yes')
else:
print('No')
|
s826715173 | p03804 | u129836004 | 1558538580 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 518 | N , M = map(int, input().split())
As =[input() for _ in range(N)]
Bs =[input() for _ in range(M)]
m = N-M
for i in range(m):
for j in range(m):
flag = True
for k in range(i, M+i):
for l in range(j, M+j):
if As[k][l] != Bs[k-i][l-j]:
flag = False
break
if not flag:
break
if flag:
break
if flag:
break
if flag:
print('Yes')
else:
print('No')
|
s596500183 | p03804 | u237493274 | 1558395087 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 287 | N, M = map(int, input().split())
a = [input() for n in range(N)]
b = [input() for m 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
if flag==1:
print("Yes")
else:
print("No") |
s086970285 | p03804 | u237493274 | 1558394905 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 262 | N, M = map(int, input().split())
a = [input() for n in range(N)]
b = [input() for m in range(M)]
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]):
print("Yes")
exit()
print("No") |
s780409268 | p03804 | u333139319 | 1558134857 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 392 | [n,m] = [int(i) for i in input().split()]
a = []
b = []
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
cnt = 0
flag = "No"
for i in range(n - m + 1):
for j in range(n - m + 1):
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 = "Yes"
else:
cnt = 0
print(flag)
|
s467911227 | p03804 | u333139319 | 1558134794 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 392 | [n,m] = [int(i) for i in input().split()]
a = []
b = []
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
cnt = 0
flag = "No"
for i in range(n - m + 1):
for j in range(n - m + 1):
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 = "Yes"
else:
cnt = 0
print(flag)
|
s874334771 | p03804 | u220345792 | 1557964632 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 444 | N, M = map(int, input().split())
data = []
for i in range(N):
data.append(input())
input_data=[]
for i in range(M):
input_data.append(input())
flag_1 = False
for i in range(N - M + 1):
for j in range(N - M + 1):
if flag = False
for k in range(M):
for l in range(M):
if data[i+k][j+l] != input_data[k][l]:
flag = True
if flag:
flag_1 = True
if flag_1:
print("Yes")
else:
print("No")
|
s532439885 | p03804 | u856169020 | 1557938397 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 704 | N, M = map(int, input().split())
n = []
m = []
for i in range(N):
s = str(input())
row = []
for j in range(N):
if s[i] == "#":
row.append(1)
else:
row.append(0)
n.append(row)
for i in range(M):
s = str(input())
row = []
for j in range(M):
if s[i] == "#":
row.append(1)
else:
row.append(0)
m.append(row)
def search(a,b):
mr = mc = 0
for r in range(a, a+M):
for c in range(b, b+M):
if n[r][c] != m[mr][mc]:
return False
mc += 1
mr += 1
return True
ans = 0
for i in range(N-M+1):
for j in range(N-M+1):
if search(i,j):
ans = 1
break
if ans:
break
if ans:
print("Yes")
else:
print("No") |
s150193123 | p03804 | u609738635 | 1557865429 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 616 | # -*- coding: utf-8 -*-
def solve(N, M, A, B):
include = False
for h in range(N-M+1):
for w in range(N-M+1):
match = True
for i in range(M):
for j in range(M):
if(A[h+i][w+j] != B[i][j]):
match = False
if(match):
include = True
print("Yes" if include else "No")
if __name__ == '__main__':
N, M = map(int, input().split())
A, B = [], []
for i in range(N):
A.append(input())
for j in range(M):
B.append(input())
solve(N, M, A, B |
s534571452 | p03804 | u856169020 | 1557860258 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 695 | N, M = map(int, input().split())
n = []
m = []
for i in range(N):
s = str(input())
row = []
for j in range(N):
if s[i] == "#":
row.append(1)
else:
row.append(0)
n.append(row)
for i in range(M):
s = str(input())
row = []
for j in range(M):
if s[i] == "#":
row.append(1)
else:
row.append(0)
m.append(row)
def search(a,b):
for r in range(a, a+M-1):
for c in range(b, b+M-1):
#print(r,c)
if n[r][c] != m[r][c]:
return False
return True
#print(n, m)
ans = 0
for i in range(N-M+1):
for j in range(N-M+1):
if search(i,j):
ans = 1
break
if ans:
break
if ans:
print("Yes")
else:
print("No") |
s514877839 | p03804 | u856169020 | 1557859271 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 659 | N, M = map(int, input().split())
n = []
m = []
for i in range(N):
s = str(input())
row = []
for j in range(N):
if s[i] == "#":
row.append(1)
else:
row.append(0)
n.append(row)
for i in range(M):
s = str(input())
row = []
for j in range(M):
if s[i] == "#":
row.append(1)
else:
row.append(0)
m.append(row)
def search(a,b):
for r in range(a, a+M):
for c in range(b, b+M):
if n[r][c] != m[r][c]:
return False
return True
ans = 0
for i in range(N-M):
for j in range(N-M):
if search(i,j):
ans = 1
break
if ans:
break
if ans:
print("Yes")
else:
print("No")
|
s902927997 | p03804 | u391731808 | 1557795954 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 466 | N,M = map(int,input().split())
A = [input() for _ in [0]*N]
B = [input() for _ in [0]*M]
endFlg = False
for i in range(N-M):
for j in range(N-M):
breakFlg = False
for k in range(M):
for l in range(M):
if A[i+k][j+l] != B[k][l]:
breakFlg = True
break
if breakFlg: break
pass
else: endFlg = True
if endFlg: break
if endFlg:print("Yes")
else:print("No") |
s236598308 | p03804 | u923712635 | 1557542543 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3060 | 342 | N,M = [int(x) for x in input().split()]
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for i in range(N-M):
for j in range(N-M):
flagx = True
for x in range(M):
if(A[i+x][j:j+M]!=B[x]):
flagx = False
if(flagx): break
if(flagx):
print('Yes')
else:
print('No')
|
s898280294 | p03804 | u614314290 | 1557032571 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 369 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
l = 0
while l <= len(A[0]) - len(B[0]):
for i in range(N - M + 1):
s = A[i][l:]
if not B[0] in s:
continue
if 0 == s.index(B[0]):
for m in range(1, M):
if 0 != A[i + m][l:].index(B[m]):
break
else:
print("Yes")
exit()
l += 1
print("No")
|
s541565771 | p03804 | u614314290 | 1556990272 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 408 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
l = 0
w = len(A[0])
while l <= len(A) - len(B):
for n in range(len(A) - len(B)):
if B[0] not in A[n][l:]:
continue
if 0 == A[n][l:].index(B[0]):
for m in range(1, len(B)):
if 0 != A[n + m][l:].index(B[m]):
break
else:
#print(n, m)
print("Yes")
exit()
l += 1
print("No")
|
s224258128 | p03804 | u614314290 | 1556990186 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 414 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
l = 0
w = len(A[0])
while l <= len(A[0]) - len(B[0]):
for n in range(len(A) - len(B)):
if B[0] not in A[n][l:]:
continue
if 0 == A[n][l:].index(B[0]):
for m in range(1, len(B)):
if 0 != A[n + m][l:].index(B[m]):
break
else:
#print(n, m)
print("Yes")
exit()
l += 1
print("No")
|
s129532426 | p03804 | u491656579 | 1556861863 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 395 | import sys
n, m = map(int, input().split())
a_array = [input() for i in range(n)]
b_array = [input() for i in range(m)]
for ai in range(n):
for aj in range(n):
can = True
for bi in range(m):
if a_array[ai+bi][aj:aj+m] != b_array[bi]:
can = False
break
if can:
print('Yes')
sys.exit()
print('No')
|
s129985206 | p03804 | u732870425 | 1556769958 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 322 | import sys
N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for y in range(N-M+1):
for x in range(N-M+1):
for k in range(M):
if A[y+k][x:x+M] != B[y+k]:
break
else:
print("Yes")
sys.exit()
print("No") |
s579945060 | p03804 | u732870425 | 1556769822 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 306 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for y in range(N-M+1):
for x in range(N-M+1):
for k in range(M):
if A[y+k][x:x+M] != B[y+k]:
break
else:
print("Yes")
exit()
print("No") |
s730365893 | p03804 | u732870425 | 1556769715 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 304 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for y in range(N-M+1):
for x in range(N-M+1):
for k in range(M):
if A[y+k][x:x+M] != B[y]:
break
else:
print("Yes")
exit()
print("No") |
s705798593 | p03804 | u091051505 | 1556463832 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 442 | n, m = map(int, input().split())
a = []
for _ in range(n):
a.append(list(input()))
b = []
for _ in range(m):
b.append(list(input()))
ans = "No"
for i in range(n-m+1):
for j in range(n-m+1):
aaa = 0
for k in range(m):
if b[k] == a[i][j:j+2]:
i += 1
aaa += 1
else:
break
if aaa == m:
ans = "Yes"
break
print(ans) |
s328828904 | p03804 | u052499405 | 1555696955 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 407 | n, m = [int(item) for item in input().split()]
a, b = [], []
for i in range(n):
a.append(input())
for j in range(m):
b.append(input())
match_line = 0
for i in range(n):
for j in range(n-m):
for k in range(m):
if a[i+k][j:j+m] == b[k]:
match_line += 1
if match_line >= m:
print("Yes")
exit()
else:
match_line = 0
continue
print("No") |
s282765849 | p03804 | u052499405 | 1555696677 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 390 | n, m = [int(item) for item in input().split()]
a, b = [], []
for i in range(n):
a.append(input())
for j in range(m):
b.append(input())
match_line = 0
for i in range(n):
for j in range(n-m):
for k in range(m):
if a[i+k][j:j+m] == b[k]:
match_line += 1
if match_line >= m:
print("Yes")
exit()
else:
match_line = 0
print("No") |
s516899574 | p03804 | u052499405 | 1555696057 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 344 | n, m = [int(item) for item in input().split()]
a, b = [], []
for i in range(n):
a.append(input())
for j in range(m):
b.append(input())
ans = [0] * (n-m)
for i in range(n):
for j in range(n-m):
if a[i][j:j+m] == b[i]:
ans[j] += 1
if ans[j] >= m:
print("Yes")
exit()
else:
ans[n-m] = 0
print("No") |
s834261333 | p03804 | u414877092 | 1555099762 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 440 | n,m=map(int,input().split())
a_list=[input() for _ in range(n)]
b_list=[input() for _ in range(m)]
for i in range(n-m+1):
for j in range(n-m+1):
f=True
for k in range(m):
for l in range(m):
if a_list[i+k][j+l]!=b_list[k][l]:
f=false
break
if not f:
break
if f:
print("Yes")
exit()
print("No") |
s189299351 | p03804 | u614314290 | 1554410918 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 522 | def INSTR():
return input()
def INNUM():
return int(INSTR())
def INSTR_S():
return INSTR().split()
def INNUM_S():
return map(int, INSTR_S())
def INSTR_M(n):
return [INSTR() for _ in range(n)]
def INNUM_SM(n):
return [tuple(INNUM_S()) for _ in range(n)]
N, M = INNUM_S()
NPIC = INSTR_M(N)
MPIC = INSTR_M(M)
for i, npic in enumerate(NPIC):
if MPIC[0] in npic:
c = npic.find(MPIC[0])
for j, mpic in enumerate(MPIC):
if c != NPIC[i + j].find(mpic):
break
else:
print("Yes")
exit()
print("No")
|
s823279128 | p03804 | u728498511 | 1554116980 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 476 | from sys import exit
n, m = map(int, input().split())
s1 = " ".join([input() for _ in range(n)])
s2 = [input() for _ in range(m)]
flag = True
i = 0
while i < m:
#try:
if s1.count(s2[i]) == 0:
print("No")
exit()
ind = s1.index(s2[i])
s1 = list(s1)
del s1[ind]
s1 = "".join(s1)
if s1[ind+n+1:ind+n+m+1:] == s2[i+1]:
i += 1
#except:
"""print("No")
exit()"""
print("Yes") |
s341245258 | p03804 | u366959492 | 1553385123 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 286 | 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+1):
for j in range(n-m+1):
x=[]
for k in range(m):
x.append(a[i+k][j+m])
if x==b:
print("Yes")
exit()
print("No")
|
s841578919 | p03804 | u598699652 | 1553229533 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 659 | n, m = map(int, input().split())
count = 0
for i in range(n):
a.append(input())
for r in range(m):
b.append(input())
for t in range(n - m+1):
# if success:
# break
for s in range(n - m+1):
# cycle 2
if a[t][s:m] == b[0]:
# if t+m> n:
# continue
tmp = 0
for y in range(m):
# if not flg:
# break
# for x in range(s, s + m):
if a[t + y][s:m] == b[y]:
# flg = False
tmp += 1
count = max(count, tmp)
if count >= m:
print("Yes")
else:
print("No") |
s823842064 | p03804 | u598699652 | 1553228194 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 699 | a = []
b = []
flg = False
success = False
n, m = map(int, input().split())
count = 0
for i in range(n):
a.append(input())
for r in range(m):
b.append(input())
for t in range(n - m+1):
if success:
break
for s in range(n - m+1):
# cycle 2
if a[t][s:m] == b[0]:
if t+m >= n:
continue
tmp = 0
for y in range(m):
# if not flg:
# break
# for x in range(s, s + m):
if a[t + y][s:m] == b[y]:
# flg = False
tmp += 1
count = max(count, tmp)
if count >= m:
print("Yes")
else:
print("No") |
s320271764 | p03804 | u598699652 | 1553226911 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 671 | a = []
b = []
flg = False
success = False
n, m = map(int, input().split())
for i in range(n):
a.append(input())
for r in range(m):
b.append(input())
for t in range(n - m+1):
if success:
break
# for s in range(0, n - m):
# cycle 2
if a[t].find(b[0]) != -1:
if t+m >= n:
continue
flg = True
for y in range(t, t + m):
# if not flg:
# break
# for x in range(s, s + m):
if a[t + y].find(b[y]) == -1:
# flg = False
break
if flg:
print("Yes")
else:
print("No") |
s521684988 | p03804 | u598699652 | 1553226639 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 670 | a = []
b = []
flg = False
success = False
n, m = map(int, input().split())
for i in range(n):
a.append(input())
for r in range(m):
b.append(input())
for t in range(n - m+1):
if success:
break
# for s in range(0, n - m):
# cycle 2
if a[t].find(b[0]) != -1:
if t+m > n:
continue
flg = True
for y in range(t, t + m):
# if not flg:
# break
# for x in range(s, s + m):
if a[t + y].find(b[y]) == -1:
# flg = False
break
if flg:
print("Yes")
else:
print("No") |
s494186656 | p03804 | u598699652 | 1553226304 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 677 | a = []
b = []
flg = False
success = False
n, m = map(int, input().split())
for i in range(0, n):
a.append(input())
for r in range(0, m):
b.append(input())
for t in range(0, n - m):
if success:
break
# for s in range(0, n - m):
# cycle 2
if a[t].find(b[0]) != -1:
if t+m > n:
continue
flg = True
for y in range(t, t + m):
# if not flg:
# break
# for x in range(s, s + m):
if a[t + y].find(b[y]) == -1:
# flg = False
break
if flg:
print("Yes")
else:
print("No") |
s843859725 | p03804 | u598699652 | 1553225552 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 732 | a = []
b = []
flg = False
success = False
n, m = map(int, input().split())
for i in range(0, n):
a.append(input())
for r in range(0, m):
b.append(input())
for t in range(0, n - m):
if success:
break
for s in range(0, n - m):
# cycle 2
if a[t][s] == b[0][0]:
flg = True
for y in range(t, t + m):
if not flg:
break
for x in range(s, s + m):
if t + y > n or s + x > n:
flg = False
break
if a[t + y][s + x] != b[y][x]:
flg = False
break
if flg:
print("Yes")
else:
print("No") |
s276149996 | p03804 | u598699652 | 1553225432 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 732 | a = []
b = []
flg = False
success = False
n, m = map(int, input().split())
for i in range(0, n):
a.append(input())
for r in range(0, m):
b.append(input())
for t in range(0, n - m):
if success:
break
for s in range(0, n - m):
# cycle 2
if a[t][s] == b[0][0]:
flg = True
for y in range(t, t + m):
if not flg:
break
for x in range(s, s + m):
if t + y > n or s + x > n:
flg = False
break
if a[t + y][s + x] != b[y][x]:
flg = False
break
if flg:
print("Yes")
else:
print("No") |
s549227928 | p03804 | u598699652 | 1553225344 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 642 | a = []
b = []
flg = False
success = False
n, m = map(int, input().split())
for i in range(0, n):
a.append(input())
for r in range(0, m):
b.append(input())
for t in range(0, n - m):
if success:
break
for s in range(0, n - m):
# cycle 2
if a[t][s] == b[0][0]:
flg = True
for y in range(t, t + m):
if not flg:
break
for x in range(s, s + m):
if t+y > n or s+x > n or a[t + y][s + x] != b[y][x]:
flg = False
break
if flg:
print("Yes")
else:
print("No") |
s903626368 | p03804 | u598699652 | 1553225184 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 619 | a = []
b = []
flg = False
success = False
n, m = map(int, input().split())
for i in range(0, n):
a.append(input())
for r in range(0, m):
b.append(input())
for t in range(0, n - m):
if success:
break
for s in range(0, n - m):
# cycle 2
if a[t][s] == b[0][0]:
flg = True
for y in range(t, t + m):
if not flg:
break
for x in range(s, s + m):
if a[t + y][s + x] != b[y][x]:
flg = False
break
if flg:
print("Yes")
else:
print("No") |
s287976650 | p03804 | u393512980 | 1552261722 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 291 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for i in range(0, M - N):
for j in range(0, M - N):
if A == B[i:i+N+1][j:j+N+1]:
flag = True
if flag:
break
if flag:
break
if flag:
print("Yes")
else:
print("No") |
s367430668 | p03804 | u619197965 | 1551987282 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 251 | n,m=[int(i) for i in input().split()]
a=[input() for i in range(n)]
b=[input() for i in range(m)]
for i in range(m):
for j in range(len(b[i])):
if b[i][j]!=a[i][j]:
result=True
break
print("No" if result else "Yes") |
s398642166 | p03804 | u932465688 | 1551403103 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 411 | 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()))
for k in range(N-M+1):
for l in range(N-M+1):
cnt = 0
if B[0][0:M] == A[k][l:l+M]:
p = k
q = l
for m in range(N-M+1):
if B[m][0:M] == A[p+m][q:q+M]:
cnt += 1
if cnt == M:
print('Yes')
exit()
print('No') |
s222396416 | p03804 | u500297289 | 1551309552 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 489 | """ AtCoder """
N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
check = True
for i in range(N - M + 1):
check = True
for j in range(M):
count = 0
for jj in range(N - M + 1):
if A[i + jj][j:j + M] != B[jj]:
check = False
break
count += 1
if count == M:
print("Yes")
exit()
if not check:
break
print("No")
|
s477378886 | p03804 | u333139319 | 1550448258 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 530 | [n,m] = [int(i) for i in input().split()]
a = []
n = []
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
#0,0からm,mまでの全てについて、合致するかどうかを全てのパターンでみる
#2*2だとして、3*3なら4個、4*4なら9個
#→差+1個あると考えて良さそう
ok = 1
for i in range(m):
for j in range(m):
for k in range(n - m):
for l in range(n - m):
if a[i+k][j+l] != b[i][j]:
ok = 0
if ok == 0:
print("No")
else:
print("Yes") |
s086849101 | p03804 | u655975843 | 1549849285 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 550 | n, m = list(map(int, input().split()))
A = []
B = []
for i in range(n):
A.append([input()])
for i in range(m):
B.append([input()])
if m > n:
print('No')
exit(0)
for j in range(n - m + 2):
for i in range(n - m + 2):
if A[j][i: i + m] == B[0][:]:
for k in range(m):
if A[j + k][i: i + m] == B[k][:]:
flag = 1
continue
flag = 0
break
if flag == 1:
print('Yes')
exit(0)
print('No')
|
s822278895 | p03804 | u655975843 | 1549847369 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 546 | n, m = list(map(int, input().split()))
A = []
B = []
for i in range(n):
A.append([input()])
for i in range(m):
B.append([input()])
if m > n:
print('No')
exit(0)
for j in range(n - m + 1):
for i in range(n - m + 1):
if A[j][i:] == B[j][:]:
for k in range(m - 1):
if A[j + k][i:] == B[j + k][:]:
flag = 1
continue
flag = 0
break
if flag == 1:
print('Yes')
exit(0)
print('No')
|
s690501191 | p03804 | u695857481 | 1549156072 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 483 | import sys
n, m = map(int, input().split())
image = []
temp = []
match = False
for i in range(n):
image.append(input())
for i in range(m):
temp.append(input())
for i in range(n):
for j in range(n - m + 1):
if (temp[0] == image[i][j : j + m]):
match = True
for k in range(1, m):
if ((temp[k] != image[i + k][j : j + m]) | (i + k >= n)):
match = False
break
if (match == True):
print('Yes')
sys.exit()
print('No') |
s203249187 | p03804 | u677312543 | 1548197949 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3188 | 505 | n, m = map(int, input().split())
a = [list(input()) for _ in range(n)]
b = [list(input()) for _ in range(m)]
f = False
for i in range(n):
for j in range(n):
if a[i][j] == b[0][0]:
for k in range(m):
for l in range(1, m):
if a[i+k][j+l] != b[k][l]:
f = True
break
if f:
break
if not f:
print('Yes')
exit()
print('No') |
s626363944 | p03804 | u677312543 | 1548197826 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 483 | n, m = map(int, input().split())
a = [list(input()) for _ in range(n)]
b = [list(input()) for _ in range(m)]
f = False
for i in range(n):
for j in range(n):
if a[i][j] == b[0][0]:
for k in range(m):
for l in range(1, m):
if a[i+k][j+l] != b[k][l]:
f = True
break
if f:
break
print('Yes')
exit()
print('No') |
s674720683 | p03804 | u726439578 | 1546812232 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 281 | w,h,n=map(int,input().split())
x1=0
y1=0
for i in range(n):
x,y,a=map(int,input().split())
if a==1:
x1=max(x1,x)
elif a==2:
w=min(w,x)
elif a==3:
y1=max(y,y1)
elif a==4:
h=min(h,y)
print((w-x1)*(h-y1) if w > x1 and h > y1 else 0) |
s165418947 | p03804 | u726439578 | 1546811818 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 260 | w,h,n=map(int,input().split())
x1=0
y1=0
for i in range(n):
x,y,a=map(int,input().split())
if a==1:
x1=max(x1,x)
elif a==2:
w=min(w,x)
elif a==3:
y1=min(y,y1)
elif a==4:
h=max(h,y)
print(max((w-x1)*(h-y1),0)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.