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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s846330074 | p03803 | u886545507 | 1486923901 | Python | Python (2.7.6) | py | Runtime Error | 16 | 2568 | 139 | #ABC054A
a,b=map(int<raw_input().split())
if a==1:
a=14
if b==1:
b=14
if a>b:
print 'Alice'
elif a<b:
print 'Bob'
else:
print 'Draw'
|
s632618821 | p03803 | u210440747 | 1486889343 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3064 | 604 | import numpy as np
if __name__=="__main__":
inputs_number = lambda : [int(x) for x in input().split()]
N, Ma, Mb = inputs_number()
drugs = [inputs_number() for i in range(N)]
inf = 100*N + 1
dp = np.ones((N+1,N*10+1,N*10+1)) * inf
dp[0,0,0] = 0.0
for i in range(N):
for ca in range(N*10+1):
for cb in range(N*10+1):
if(dp[i,ca,cb]==inf):
continue
dp[i+1,ca,cb]=np.min([dp[i+1,ca,cb],dp[i,ca,cb]])
dp[i+1,ca+drugs[i][0],cb+drugs[i][1]]=np.min([dp[i+1,ca+drugs[i][0],cb+drugs[i][1]],dp[i,ca,cb]+drugs[i][2]]) |
s496014485 | p03803 | u210440747 | 1486886916 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 812 | import numpy as np
if __name__=="__main__":
inputs_number = lambda : [int(x) for x in input().split()]
N, Ma, Mb = inputs_number()
drugs = np.array([inputs_number() for i in range(N)])
inf = 100*N + 1
dp = np.ones((N,N*10,N*10)) * inf
dp[0,0,0] = 0
for i in range(0, N-1):
for ca in range(N*10):
for cb in range(N*10):
if(dp[i,ca,cb]==inf):
continue
dp[i+1,ca,cb]=np.min([dp[i+1,ca,cb],dp[i,ca,cb]]);
dp[i+1,ca+drugs[i,0],cb+drugs[i,1]]=np.min([dp[i+1,ca+drugs[i,0],cb+drugs[i,1]],dp[i,ca,cb]+drugs[i,2]]);
ans = inf
for i in range(1, N):
for ca in range(1, N*10):
for cb in range(1, N*10):
if(Ma*cb == Mb*ca and dp[i,ca,cb] < ans):
ans = dp[i,ca,cb]
if(ans==inf):
ans = -1
print(int(ans)) |
s935144249 | p03803 | u942697937 | 1486872166 | Python | Python (2.7.6) | py | Runtime Error | 19 | 2696 | 571 | from copy import deepcopy
N, MA, MB = map(int, raw_input().split())
X = [map(int, raw_input().split()) for _ in range(N)]
DP = [[100000 for _ in range(401)] for _ in range(401)]
DP[0][0] = 0
S = {(0, 0)}
for a, b, c in X:
DP2 = deepcopy(DP)
for sa, sb in S:
if DP[sa+a][sb+b] > DP2[sa][sb] + c:
DP[sa+a][sb+b] = DP2[sa][sb] + c
T = {(sa+a, sb+b) for sa, sb in S}
S |= T
a, b = MA, MB
ans = 100000
while a <= 400 and b <= 400:
ans = min(ans, DP[a][b])
a += MA
b += MB
if ans == 100000:
print -1
else:
print ans
|
s806416553 | p03803 | u397933464 | 1486871305 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 271 | m,n=map(int,raw_input().split())
a=[]*m
b=[]*n
p=0
q=0
while(q<m):
q+=1
a.append(raw_input())
while(p<n):
p+=1
b.append(raw_input())
flag=False
# print a
# print b
for i in xrange(n):
if not b[i] in (a[i]):
flag=True
break
if flag:
print "No"
else:
print "Yes" |
s198677571 | p03803 | u012693733 | 1486870265 | Python | Python (2.7.6) | py | Runtime Error | 855 | 19268 | 239 | import numpy as np
n, m = map(int, raw_input().split())
a = [raw_input() for _ in xrange(n)]
b = [raw_input() for _ in xrange(m)]
f = False
for i in xrange(m):
if b[i] in a:
f = True
if f:
print "Yes"
else:
print "No"
|
s645147603 | p03803 | u210440747 | 1486869542 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 227 | if __name__=="__main__":
a, b = list(map(int, input().split(" ")))
if(a == 1):
a = 14
if(b == 1):
b = 14
if(a > b):
print("Alice")
elif(a == b):
print("Draw")
else:
print("Bob") |
s263520752 | p03803 | u210440747 | 1486869267 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 271 | import sys
if __name__=="__main__":
a, b = list(map(int, input().split(" ")))
if(a == 1):
a = 14
if(b == 1):
b = 14
if(a > b):
sys.stdout.write("Alice")
elif(a == b):
sys.stdout.write("Draw")
else:
sys.stdout.write("Bob") |
s541671240 | p03803 | u210440747 | 1486869073 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 202 | import sys
if __name__=="__main__":
a, b = list(map(int, input().split(" ")))
if(a > b):
sys.stdout.write("Alice")
elif(a == b):
sys.stdout.write("Draw")
else:
sys.stdout.write("Bob") |
s750212605 | p03803 | u210440747 | 1486868817 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 219 | import sys
if __name__=="__main__":
a, b = list(map(int, input().replace("\n","").split(" ")))
if(a > b):
sys.stdout.write("Alice")
elif(a == b):
sys.stdout.write("Draw")
else:
sys.stdout.write("Bob") |
s147620430 | p03803 | u065683101 | 1486867559 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 313 | def read():
return int(input())
def reads(sep=None):
return list(map(int, input().split(sep)))
def main():
a, b = input()
if a == 1:
a = 14
if b == 1:
b = 14
if a == b:
print('Draw')
elif a > b:
print('Alice')
else:
print('Bob')
main()
|
s049644734 | p03803 | u762603420 | 1486867557 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 499 | n = input().split()
ar = int(n[0])
br = int(n[1])
a = []
b = []
for i in range(0, ar):
a.append(input())
for j in range(0, br):
b.append(input())
find = False
for i in range(0, ar - br):
idx = a[i].find(b[0])
if idx != -1:
match = True
for j in range(1, br):
idx2 = a[i + j].find(b[j])
if idx != idx2:
match = False
if match:
find = True
break
if find:
print("Yes")
else:
print("No") |
s409208400 | p03803 | u714779404 | 1486867506 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2696 | 1262 | n,m = map(int, raw_input().split())
n_list = [] #row major format
m_list = []
for i in range(0, n):
n_list.append(raw_input())
for x in range(0, m):
m_list.append(raw_input())
def match_first_rows(n_start):
result = (-1,-1)
first_m = m_list[0] # first row
for x in range(n_start, n):
n_row = n_list[x]
if first_m in n_row: # substring matching of first m_row
j = n_row.index(first_m)
return (x, j)
return (-1,-1) #return -1,-1 if none found
# given the leftmost corner of matching in matrix n, start matching each row to see if there is a potential match
# only guranteed first row match
def begin_matching(i,j):
nx_start = i
ny_start = j
for x in range(0,m):
n_row_string = n_list[nx_start+x]
n_string = n_row_string[j:j+m] # align window
m_string = m_list[x]
if n_string!=m_string:
return False
return True
def find_m():
found_m = False
counter = 0
while(counter<=n-m and not(found_m)):
i,j = match_first_rows(counter)
if i==-1:
#goes through entirety, not returning things at all
print("No")
found_m = True
# found a potential starting point
else:
result = begin_matching(i,j)
if result:
print("Yes")
found_m = True
else:
#do it again, but one row lower
counter +=1
find_m() |
s753622582 | p03803 | u583826716 | 1486867345 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 539 | from itertools import product
n, m = [int(i) for i in input().rstrip().split()]
AA = [[0 if i == '.' else 1 for i in input().rstrip()] for _ in range(n)]
BB = [[0 if i == '.' else 1 for i in input().rstrip()] for _ in range(m)]
for i_r, i_c in product(range(n - m + 1), range(n - m + 1)):
i_r -= 1
i_c -= 1
for k_r, k_c in product(range(m), range(m)):
if AA[i_r + k_r][i_c + k_c] == BB[k_r][k_c]:
continue
else:
break
else:
print('Yes')
break
else:
print('No') |
s015730302 | p03803 | u822353071 | 1486866972 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2696 | 164 | #A One card Poker
A,B = [int(i) for i in input().split(" ")]
if A == B:
print("Draw")
elif (A == 1) or (A>B and B!=1):
print("Alice")
else:
print("Bob") |
s868107684 | p03803 | u759482921 | 1486866453 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 718 | import sys
input_num = input().split()
N = int(input_num[0])
M = int(input_num[1])
A = [input() for i in range(0, N-1)]
B = [input() for n in range(0, M-1)]
if M > N:
print("No")
elif M == N:
for a, b in zip(A, B):
if b not in a:
print("No")
else:
print("Yes")
else:
diff = N - M
breaked = False
for i in range(0, len(A)-1):
l = i
while l <= i + diff and l < len(B):
if A[i] == B[l]:
breaked = True
break
else:
if breaked:
print("No")
sys.exit()
l += 1
if breaked:
print("Yes")
else:
print("No") |
s865716859 | p03803 | u985443069 | 1486866441 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 622 | from itertools import permutations
def f(n, m, uu, vv):
a = [[0] *n for _ in range(n)]
for u, v in zip(uu, vv):
a[u][v] = 1
a[v][u] = 1
res = 0
for p in permutations(range(n)):
if p[0] != 0:
break
ok = True
for i in range(n - 1):
if a[p[i]][p[i+1]] == 0:
ok = False
break
if ok:
res += 1
return res
n , m = map(int, input().split())
a = []
b = []
for k in range(m):
_a, _b = map(int, input().split())
_a -= 1
_b -= 1
a.append(_a)
b.append(_b)
print(f(n, m, a, b))
|
s578441122 | p03803 | u210440747 | 1486866076 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 192 | #coding: utf-8
if __name__=="__main__":
a, b = list(map(int, input().replace("\n","").split(" ")))
if(a > b):
print("Alice")
elif(a == b):
print("Draw")
else:
print("Bob")
|
s573260794 | p03803 | u272028993 | 1486865880 | Python | PyPy2 (5.6.0) | py | Runtime Error | 34 | 28396 | 494 | def check(y,x):
if 0<=y<=n-1 and 0<=x<=n-1:
return True
return False
n,m=map(int,raw_input().split())
a=[raw_input() for _ in xrange(n)]
b=[raw_input() for _ in xrange(m)]
for i in xrange(n):
for j in xrange(n):
cnt=0
for k in range(m):
for l in xrange(m):
if check(k+i,l+j):
if a[k+i][l+j]==b[k][l]:
cnt+=1
if cnt==m*m:
print("Yes")
exit()
print("No")
|
s451215159 | p03803 | u249895018 | 1486865620 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 298 | for line in sys.stdin:
card = line.split(" ")
alice = int(card[0])
bob = int(card[1])
if alice == 1:
alice += 13
if bob == 1:
bob += 13
if alice > bob:
print("Alice")
elif alice < bob:
print("Bob")
else:
print("Draw") |
s951616636 | p03803 | u397933464 | 1486865599 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 126 | a,b=map(int,raw_input().split())
def val():
if a==1 or (a>b and b!=1):
return "ALICE"
else:
return "BOB"
print (val()) |
s038672146 | p03803 | u007848713 | 1486865512 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 275 |
alice = int(input())
bob = int(input())
if(alice == bob):
print("Draw")
elif(alice == 1 and bob == 1):
print("Draw")
elif(alice == 1):
print("Alice")
elif(bob == 1):
print("Bob")
elif(alice < bob):
print("Bob")
elif(alice > bob):
print("Alice") |
s345364886 | p03803 | u007848713 | 1486865463 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 381 | # -*- coding: utf-8 -*-
"""
Spyderエディタ
これは一時的なスクリプトファイルです
"""
alice = int(input())
bob = int(input())
if(alice == bob):
print("Draw)
elif(alice == 1 and bob == 1):
print("Draw")
elif(alice == 1):
print("Alice")
elif(bob == 1):
print("Bob")
elif(alice < bob):
print("Bob")
elif(alice > bob):
print("Alice")
|
s320821773 | p03803 | u007848713 | 1486865332 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 483 | # -*- coding: utf-8 -*-
alice = int(input())
bob = int(input())
if(alice == bob):
print("Draw)
elif(alice == 1 and bob == 1):
print("Draw")
elif(alice == 1):
print("Alice")
elif(bob == 1):
print("Bob")
elif(alice < bob):
print("Bob")
elif(alice > bob):
print("Alice")
|
s819143597 | p03803 | u714779404 | 1486865327 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 197 | a,b = map(int, raw_input().split())
if a==b:
print("Draw")
else:
if a!=1 and b!=1:
if a<b:
print("Bob")
else:
print("Alice")
elif a==1 and b!=1:
print("Alice")
else:
print("Bob") |
s297374173 | p03803 | u007848713 | 1486865263 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 525 | # -*- coding: utf-8 -*-
"""
Spyderエディタ
これは一時的なスクリプトファイルです
"""
alice = int(input())
bob = int(input())
if(alice == bob):
print("Draw)
elif(alice == 1 and bob == 1):
print("Draw")
elif(alice == 1):
print("Alice")
elif(bob == 1):
print("Bob")
elif(alice < bob):
print("Bob")
elif(alice > bob):
print("Alice")
|
s070628076 | p03803 | u249895018 | 1486865133 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 246 | !/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
for line in sys.stdin:
card = line.split(" ")
if card[0] > card[1]:
print("Alice")
elif card[0] < card[1]:
print("Bob")
else:
print("Draw") |
s469298933 | p03803 | u150117535 | 1486865132 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 144 | if A == B:
print("Draw")
elif A == 1:
print("Alice")
elif B == 1:
print("Bob")
elif A > B:
print("Alice")
else:
print("Bob") |
s993641596 | p03803 | u496340257 | 1486865123 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 205 | #!/usr/bin/env python3
Alice, Bob = map(int, input())
if Alice == 1:
Alice = 14
if Bob == 1:
Bob = 14
if Alice > Bob:
print('Alice')
elif Bob > Alice:
print('Bob')
else:
print('Draw') |
s754688264 | p03803 | u598167418 | 1486864987 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 214 | a = ['2','3','4','5','6','7','8','9','10','11','12','13']
al,bo = map(str,raw_input().split())
if a.index(al) > a.index(bo):
print 'Alice'
elif a.index(al) < a.index(bo):
print 'Bob'
else:
print 'Draw'
|
s918338443 | p03804 | u521323621 | 1601102307 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9100 | 355 | n,m = map(int, input().split())
ma = []
for i in range(n):
ma.append(input())
t = []
for i in range(m):
t.append(input())
ly = len(t[0])
lt = m
ans = False
for i in range(n):
for j in range(n):
for k in range(lt):
if ma[i + k][j : j + ly + 1] != t[k]:
break
else:
ans = True
if ans:
print("Yes")
else:
print("No")
|
s971227931 | p03804 | u492910842 | 1600658927 | Python | PyPy3 (7.3.0) | py | Runtime Error | 131 | 74684 | 257 | 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-m+1):
for j in range(n-m+1):
if [line[j:j+m] for line in a[i:i+m]]==B:
ans="Yes"
break
if ans=="Yes":
break
print(ans) |
s129022679 | p03804 | u787059958 | 1600386578 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9148 | 870 | N, M = map(int, input().split())
A = []
for _ in range(N):
a = input()
A.append(a)
B = []
for _ in range(M):
b = input()
B.append(b)
idx = [0, 0]
while True:
if idx[0] == N - 1 and idx[1] == N:
break
if A[idx[0]][idx[1]] == B[0][0]:
check = False
for i in range(M):
for j in range(M):
if 0 <= idx[0] + i < N and 0 <= idx[1] + j < N:
if A[idx[0] + i][idx[1] + j] != B[i][j]:
check = True
break
else:
check = True
break
if check:
break
if not check:
print('Yes')
exit()
if idx[1] < N - 1:
idx[1] += 1
continue
else:
idx[0] += 1
idx[1] = 1
continue
print('No')
|
s720637021 | p03804 | u666550725 | 1599860202 | Python | PyPy3 (7.3.0) | py | Runtime Error | 93 | 74636 | 448 | N, M = map(int, input().split())
A = []
B = []
for i in range(N):
A.append(input())
for i in range(N):
B.append(input())
f = 0
for i in range(N - M + 1):
for j in range(N - M + 1):
g = 0
for k in range(M):
for l in range(M):
if A[i+k][j+l] != B[k][l]:
g = 1
break
if g == 1:
break
if g == 0:
print("Yes")
f = 1
break
if f == 1:
break
if f == 0:
print("No") |
s742012124 | p03804 | u750651325 | 1599663233 | Python | Python (3.8.2) | py | Runtime Error | 41 | 10420 | 938 | import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
AL = al.upper()
n,m = I()
a = [v() for i in range(n)]
b = [v() for i in range(m)]
for j in range(m):
place = []
for i in range(n-m):
if b[j] in a[i]:
m_place = re.match(b[j],a[i])
xxx = m_place.span()
place.append(xxx)
ans = list(set(place))
if len(ans) == 1:
print("Yes")
sys.exit()
print("No") |
s186377388 | p03804 | u070423038 | 1598176016 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9020 | 613 | A, B = map(int, input().split())
a_lst = []
for i in range(A):
a_lst.append(input().replace('#', '1').replace('.', '0'))
b_lst = []
for i in range(B):
b_lst.append(input().replace('#', '1').replace('.', '0'))
for i in range(len(a_lst)):
if len(a_lst)-i < len(b_lst):
break
if b_lst[0] in a_lst[i]:
idx = a_lst[i].index(b_lst[0])
for j in range(1, len(b_lst)):
if b_lst[j] in a_lst[i+i] and a_lst[i+1].index(b_lst[j]) == idx:
continue
else:
break
else:
print('Yes')
exit()
print('No') |
s029184870 | p03804 | u146066372 | 1597464330 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9112 | 349 | n,m=map(int,input().split())
a=[]
b=[]
cnt=0
k=0
flag=0
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
for j in range(n-m+1):
k=0
for i in range(n-m+1):
if b[k]==a[i][j:j+m]:
k+=1
if k==m:
print("Yes")
flag+=1
if flag==0:
print("No")
|
s566972050 | p03804 | u350093546 | 1597439918 | Python | PyPy3 (7.3.0) | py | Runtime Error | 394 | 86936 | 365 | n,m=map(int,input().split())
x=[[input()] for i in range(n)]
y=[[input()] for i in range(m)]
for i in range(n-m+1):
for j in range(n-m+1):
if x[i][j]==y[0][0]:
if m==1:
print('Yes')
exit()
for k in range(m):
if x[i+k][j:j+n-m+1]!=y[k]:
continue
print('Yes')
exit()
print('No') |
s157220984 | p03804 | u766646838 | 1597178597 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9268 | 789 | N,M = map(int,input().split())
a = []
c = []
for i in range(N):
b = list(input())
a+=b
for i in range(M):
b = list(input())
c+=b
#print(c,a)
f = False
for i in range(N*N):
if f == True:
break
if N*N-i<M*M:
break
count=0
flag = True
#print(i,c[0],a[i])
if c[0] == a[i]:
if N-((i)%N)<M:
continue
num = i
for j in range(M):
for k in range(M):
#print(c[count],a[num])
if c[count] == a[num]:
num+=1
count+=1
elif c[count]!=a[num]:
flag =False
break
num+=N-M
if flag == False:
#print(i)
break
if j == M-1:
f = True
else:
continue
if f == False:
print('No')
else:
print('Yes')
|
s827754778 | p03804 | u766646838 | 1597177801 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9228 | 779 | N,M = map(int,input().split())
a = []
c = []
for i in range(N):
b = list(input())
a+=b
for i in range(M):
b = list(input())
c+=b
f = False
for i in range(N*N):
if f == True:
break
if N*N-(i)<M*M:
break
count=0
flag = True
#print(i,c[0],a[i])
if c[0] == a[i]:
if N-((i)%N)<M:
continue
num = i
for j in range(M):
for k in range(M):
#print(c[count],a[num])
if c[count] == a[num]:
num+=1
count+=1
elif c[count]!=a[num]:
flag =False
break
num+=N-M
if flag == False:
#print(i)
break
if j == M-1:
f = True
else:
continue
if f == False:
print('No')
else:
print('Yes')
|
s936215246 | p03804 | u215315599 | 1596294312 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9124 | 403 | N, M = map(int, input().split())
A = [ input() for i in range(N)]
B = [ input() for i in range(M)]
def serch(x0, y0):
for i in range(M):
for j in range(M):
if A[x0+i][y0+j] != B[i][j]:
return False
return True
if M > N:
print('No')
exit()
for x in range(N):
for y in range(N):
if not serch(x,y):
continue
else:
print('Yes')
exit()
print('No')
|
s871625067 | p03804 | u215315599 | 1596294252 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9156 | 428 | N, M = map(int, input().split())
A = [ input() for i in range(N)]
B = [ input() for i in range(M)]
def serch(x0, y0):
for i in range(M):
for j in range(M):
if A[x0+i][y0+j] != B[i][j]:
return False
return True
if M > N:
print('No')
exit()
for b in B:
for x in range(N):
for y in range(N):
if not serch(x,y):
continue
else:
print('Yes')
exit()
print('No')
|
s114067582 | p03804 | u215315599 | 1596294157 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9196 | 395 | N, M = map(int, input().split())
A = [ input() for i in range(N)]
B = [ input() for i in range(M)]
def serch(x0, y0):
for i in range(M):
for j in range(M):
if A[x0+i][y0+j] != B[i][j]:
return False
return True
for b in B:
for x in range(N):
for y in range(N):
if not serch(x,y):
continue
else:
print('Yes')
exit()
print('No')
|
s460174775 | p03804 | u036104576 | 1595753701 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9412 | 700 | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
def check(x, y):
for i in range(M):
for j in range(M):
if A[y + i][x + j] != B[i][j]:
return False
return True
for i in range(N):
for j in range(N):
if check(i, j):
print("Yes")
exit()
print("No")
|
s043357936 | p03804 | u040298438 | 1595256214 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9040 | 459 | n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
flg = False
for i in range(n - m + 1):
for j in range(n - m + 1):
if a[i][j : j + m] == b[0]:
for k in range(i + 1, i + m):
if a[k][j : j + m] != b[k]:
break
else:
print("Yes")
flg = True
break
if flg:
break
else:
print("No") |
s307138174 | p03804 | u465101448 | 1595168817 | Python | PyPy3 (7.3.0) | py | Runtime Error | 108 | 74644 | 452 | import numpy as np
N,M = list(map(int,input().split()))
A=[]
B=[]
for n in range(N):
A_ = list(input())
A.append(A_)
for m in range(M):
B_ = list(input())
B.append(B_)
B=np.array(B)
ans='No'
for n1 in range(N-M+1):
for n2 in range(N-M+1):
check = np.array(A)[n1:n1+M,n2:n2+M]
c=np.unique(check == B)
if False not in set(c):
ans='Yes'
break
print(ans) |
s900332284 | p03804 | u232873434 | 1594819218 | Python | PyPy3 (7.3.0) | py | Runtime Error | 91 | 74704 | 523 | 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):
flg = True
for k in range(M):
for l in range(M):
if A[i+k][j+l] == B[k][l]:
pass
else:
flg=False
break
if flg==False:
break
if flg:
break
if flg:
break
if flg:
print('Yes')
else:
print('No') |
s604899174 | p03804 | u025236579 | 1594781655 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9124 | 895 | def template_matching():
# 入力
N, M = map(int, input().split())
A = list()
B = list()
for _ in range(N):
dummy = input()
A.append(dummy)
for _ in range(M):
dummy = input()
B.append(dummy)
# 比較
for i in range(M):
for j in range(N):
# M*Mの一行目がN*Nのいずれかの列に含まれるか
if B[i] in A[j]:
row = A[j].find(B[i])
line = j
# 正方形を含むか否か
for k in range(M):
if B[k] == A[line+k][row:row+M]:
include = True
else:
include = False
break
if include:
return True
return False
# 出力
if template_matching():
print('Yes')
else:
print('No') |
s959743005 | p03804 | u634079249 | 1594588505 | Python | Python (3.8.2) | py | Runtime Error | 32 | 10132 | 1262 | import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = il()
A = [iss() for _ in range(N)]
B = [iss() for _ in range(M)]
for i in range(N):
for j in range(N):
for b in B:
if A[i][j:] == b: i += 1
else:break
else:
print('Yes')
exit()
else:
print('No')
if __name__ == '__main__':
main()
|
s941044423 | p03804 | u357751375 | 1594231419 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9108 | 367 | n,m = map(int,input().split())
a = [list(input()) for i in range(n)]
b = [list(input()) for i in range(m)]
for i in range(n):
for j in range(n):
t = 1
for k in range(m):
for l in range(m):
if a[i+k][j+l] != b[k][l]:
t = 0
if t == 1:
print('Yes')
exit(0)
print('No') |
s448483245 | p03804 | u050622763 | 1593984086 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9120 | 325 | def abc054_b():
N,M = map(int,input().split())
a = [input() for i in range(N)]
b = [input() for i in range(M)]
#['#.#', '.#.', '#.#']
ans = 0
for n in range(N-1):
for m in range(M-1):
if b[n] in a[m]:
ans+=1
print("Yes" if ans==len(b) else "No")
abc054_b()
|
s419962712 | p03804 | u093041722 | 1593902839 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9156 | 380 | N,M,*f = open(0).read().split()
N = int(N)
M = int(M)
A = f[:N]
B = f[N:]
for i in range(N):
for j in range(N-M+1):
if A[i][j:j+M] == B[0]:
for k in range(1,M):
if A[i+k][j:j+M] != B[k]:
break
else:
print('Yes')
break
else:
continue
break
else:
print('No') |
s996192756 | p03804 | u095426154 | 1592966248 | Python | PyPy3 (7.3.0) | py | Runtime Error | 81 | 68640 | 461 | # coding: utf-8
N,M=map(int,input().split())
picN=[]
picM=[]
for i in range(N):
L=list(input())
picN.append(L)
for i in range(M):
L=list(input())
picM.append(L)
K=N-M
for i in range(K):
for j in range(K):
flg=True
for a in range(M):
for b in range(M):
if picN[a+i][b+j]!=picM[a][b]:
flg=False
if flg:
break
if flg:
print("YES")
else:
print("NO") |
s088108104 | p03804 | u958506960 | 1591846174 | Python | Python (3.4.3) | py | Runtime Error | 179 | 3064 | 431 | n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
s = 0
cnt = 0
for i in range(n-m+1):
for j in range(n-m+1):
for x in range(m):
for y in range(m):
if a[i+x][j+y] == b[x][y]:
s += 1
if s == m ** 2:
cnt += 1
else:
s = 0
if c > 0:
print('Yes')
else:
print('No') |
s506966514 | p03804 | u131411061 | 1591632626 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 418 | import sys
N,M = map(int,input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
def comp(x,y):
for i in range(M):
for j in range(M):
if A[x+i][y+j] != B[i][j]:
return False
return True
for i in range(N-M+1):
for j in range(N-M+1):
if comp(i,j):
flag = True
break
if flag:
print('Yes')
else:
print('No') |
s223107562 | p03804 | u131411061 | 1591631512 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 451 | import sys
N,M = map(int,input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
cnt = 0
if A < B:
print('No')
sys.exit()
else:
for i in range(N):
for j in range(M):
if B[j] in A[i]:
cnt+=1
flag = True
else:
cnt = 0
flag = False
if cnt == M:
break
if flag:
print('Yes')
else:
print('No') |
s850065932 | p03804 | u131411061 | 1591631481 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 451 | import sys
N,M = map(int,input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
cnt = 0
if A < B:
print('No')
sys.exit()
else:
for i in range(N):
for j in range(M):
if B[j] in A[i]:
cnt+=1
flag = True
else:
cnt = 0
flag = False
if cnt == M:
break
if flag:
print('Yes')
else:
print('No') |
s413772194 | p03804 | u131411061 | 1591631223 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 423 | N,M = map(int,input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
cnt = 0
if A < B:
print('No')
else:
for i in range(N):
for j in range(M):
if B[j] in A[i]:
cnt+=1
flag = True
else:
cnt = 0
flag = False
if cnt == M:
break
if flag:
print('Yes')
else:
print('No') |
s862407461 | p03804 | u131411061 | 1591631069 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 372 | N,M = map(int,input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
cnt = 0
if A < B:
print('No')
else:
for i in range(M):
if B[i] in A[i]:
cnt+=1
flag = True
else:
cnt = 0
flag = False
if cnt == M:
break
if flag:
print('Yes')
else:
print('No') |
s409589723 | p03804 | u757274384 | 1591420948 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 279 | n,m = map(int, input().split())
A = [input() for i in range(n)]
B = [input() for j 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]:
if all(A[i+k][j:j+m] == B[k] for k in range(1,M)):
print("Yes")
exit()
print("No")
|
s052707846 | p03804 | u757274384 | 1591420913 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 278 | n,m = map(int, input().split())
A = [input() for i in range(n)]
B = [intpu() for j 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]:
if all(A[i+k][j:j+m] == B[k] for k in range(1,M)):
print("Yes")
exit()
print("No") |
s342033950 | p03804 | u919025034 | 1590901065 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 367 | N,M = map(int,input().split())
a_g=[];b_g=[]
for i in range(N):
a_g.append(list(input()))
for i in range(M):
b_g.append(list(input()))
for i in range(N-M):
for j in range(N-M):
flag=1
for k in range(M):
for l in range(M):
if a_g[k+i][l+j] != b_g[k][l]:
flag=0
l=M;k=M
if flag:
print("Yes");exit()
print("No") |
s436529277 | p03804 | u489124637 | 1590875753 | Python | PyPy3 (2.4.0) | py | Runtime Error | 183 | 39664 | 383 | 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 h in range(N-M+1):
cnt = 0
for k in range(M):
for j in range(M):
if A[i+k][h+j] != B[k][h]:
cnt += 1
if cnt == 0:
break
if cnt == 0:
print("Yes")
else:
print("No") |
s801419996 | p03804 | u662430503 | 1590853617 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 633 | def main():
num = list(map(int,input().split()))
n=num[0]
m=num[1]
a = [input() for i in range(n)]
b = [input() for i in range(m)]
flg=0
for i in range(0 , n):
while a[i].find(b[0])!=-1:
##print("while",a[i])
start=a[i].find(b[0])
for j in range(1 , m):
##print("i=",i)
##print("j=",j)
##print("a[i+j]=",a[i+j])
if a[i+j][start:start+m]!=b[j]:
break
if j==m-1:
flg=1
if flg==1:
break
a[i]=a[i][a[i].find(b[0])+1:]
if flg==1:
break
if flg==1:
print("Yes")
else:
print("No")
main() |
s406508222 | p03804 | u453642820 | 1590792937 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 289 | N,M=map(int,input().split())
A=[input() for i in range(N)]
B=[input() for j in range(M)]
for i in range(N):
for j in range(N-M+1):
if A[i][j:j+M]==B[0]:
if all(A[i+k][j:j+M]==B[k] for k in range(1,M)):
print("Yes")
exit()
print("No") |
s433400586 | p03804 | u453642820 | 1590792748 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 287 | N,M=map(int,input().split())
A=[input() for i in range(N)]
B=[input() for j in range(M)]
for i in range(N):
for j in range(N-M):
if A[i][j:j+M]==B[0]:
if all(A[i+k][j:j+M]==B[k] for k in range(1,M)):
print("Yes")
exit()
print("No") |
s353961376 | p03804 | u285891772 | 1590785386 | Python | Python (3.4.3) | py | Runtime Error | 39 | 5200 | 1155 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#import numpy as np
#from decimal import *
N, M = MAP()
A = [input() for _ in range(M)]
B = [input() for _ in range(M)]
for i in range(N-M+1):
for j in range(N-M+1): #左上野ますが(i, j)
tmp_lis = []
for k in range(M):
tmp_lis.append(A[i+k][j:j+M])
if tmp_lis == B:
print("Yes")
exit()
else:
print("No") |
s395446636 | p03804 | u594956556 | 1590589895 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 291 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(N)]
for i in range(N-M+1):
for j in range(N-M+1):
for k in range(M):
if A[i+k][j:j+M] != B[k]:
break
else:
print('Yes')
exit()
break
print('No') |
s033403488 | p03804 | u207241407 | 1590177354 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 376 | n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
h = len(b)
w = len(b[0])
for i in range(h):
for j in range(w):
tmp = []
for k in range(h):
tmp.append(a[i + k][j : j + w])
if b == tmp:
print("Yes")
break
else:
continue
break
else:
print("No") |
s854429215 | p03804 | u517630860 | 1589862598 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 532 | # -*- coding: utf-8 -*-
N, M = map(int, input().split())
A = []
B = []
for i in range(N):
A.append(input())
for i in range(M):
B.append(input())
for i in range(N):
offset = 0
while offset + M <= N:
pos = A[i][offset:].find(B[0])
if -1 == pos:
break
offset += pos
for j in range(1,M):
if 0 != A[i+j][offset:].find(B[j]):
offset += 1
break
else:
print('Yes')
exit()
else:
print('No')
|
s493082000 | p03804 | u798260206 | 1589644545 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 346 | 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):
cnt=0
if A[i][j:j+M] ==B[0]:
for k in range(1,M):
if A[i+k][j:j+M] == B[k]:
cnt+=1
if cnt==M-1:
ans='Yes'
print(ans) |
s080281430 | p03804 | u125545880 | 1589542701 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 657 | import sys
readline = sys.stdin.readline
def main():
N, M = map(int, readline().split())
n = []
for _ in range(N):
n.append(list(readline()[:-1]))
m = []
for _ in range(M):
m.append(list(readline()[:-1]))
s = N - M
for i in range(s):
for j in range(s):
flag = True
for k in range(M):
if n[i+k][j:j+M] != m[k]:
flag = False
break
if flag:
break
if flag:
break
if flag:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
|
s408065186 | p03804 | u145231176 | 1589494219 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38640 | 1192 | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(input()) for i in range(intn)]
from collections import defaultdict, deque, Counter
from sys import exit
import heapq
import math
import copy
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
def dfs(idx, end, value, cost, g):
if idx == end:
if cost == 0:
return
if value not in g:
g[value] = cost
else:
g[value] = min(g[value], cost)
return
a, b, c = table[idx]
dfs(idx + 1, end, value + b * Ma - a * Mb, cost + c, g)
dfs(idx + 1, end, value, cost, g)
N, Ma, Mb = map(int, input().split())
table = [tuple(map(int, input().split())) for i in range(N)]
g1, g2 = dict(), dict()
dfs(0, N // 2, 0, 0, g1)
dfs(N // 2, N, 0, 0, g2)
inf = 100*40 + 1
ans = inf
if 0 in g1:
ans = min(ans, g1[0])
if 0 in g2:
ans = min(ans, g2[0])
for v1, c1 in g1.items():
if -v1 in g2:
tmp = c1 + g2[-v1]
ans = min(ans, tmp)
if ans < inf:
print(ans)
else:
print(-1)
|
s023065182 | p03804 | u758411830 | 1589162234 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 270 | N, M = map(int, input().split())
A = [list(input()) for _ in range(N)]
B = ''
for _ in range(M):
B += input()
ans = 'No'
for i in range(N-M+1):
for j in range(N-M+1):
sbstr = ''.join(A[i][j:j+M] + A[i+1][j:j+M])
if B == sbstr:
ans = 'Yes'
print(ans)
|
s186441160 | p03804 | u519923151 | 1589082744 | Python | Python (3.4.3) | py | Runtime Error | 71 | 3064 | 480 | n,m = map(int, input().split())
nl = [list(input()) for _ in range(n)]
ml = [list(input()) for _ in range(m)]
for i in range (0,n-(n-m)):
for j in range (0,n-(n-m)):
if nl[i][j] ==ml[0][0]:
flag = 1
for k in range(0,m):
for l in range(0,m):
if nl[i+k][j+l] !=ml[k][l]:
flag = 0
if flag ==1:
print("Yes")
exit()
print("No") |
s716911083 | p03804 | u980783809 | 1588803812 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 604 | , m = map(int, input().split())
nl=[]
ml=[]
for i in range(n):
nl.append(input())
for i in range(m):
ml.append(input())
cnt=0
Yes=False
for i in nl:
if(ml[0] in i):
idx = i.find(ml[0])
cnt2=cnt+1
for j in range(1,m):
if cnt2>n-1:
ok = False
break
elif(not ml[j]==nl[cnt2][idx:idx+m]):
ok=False
break
elif(j==m-1):
Yes = True
break
cnt2+=1
if(Yes):
break
cnt+=1
if Yes:
print("Yes")
else:
print("No") |
s154811807 | p03804 | u267300160 | 1588641940 | Python | Python (3.4.3) | py | Runtime Error | 180 | 12444 | 327 | 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)])
for i in range(N):
for j in range(N):
check = A[i:i+M,j:j+M]
print(check)
if (check == B).all():
print("Yes")
exit()
print("No")
|
s618432715 | p03804 | u267300160 | 1588641876 | Python | Python (3.4.3) | py | Runtime Error | 165 | 12432 | 306 | 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)])
for i in range(M):
for j in range(M):
check = A[i:i+M,j:j+M]
if (check == B).all():
print("Yes")
exit()
print("No")
|
s094226194 | p03804 | u277641173 | 1588553967 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 295 | n,m=map(int,input().split())
a=[]
for i in range(n):
a.append(input())
b=[]
for i in range(m):
b.append(input())
res=0
for i in range(0,n-m+1):
keep=0
for j in range(i,i+m):
if b[j-i] in a[j]:
keep+=1
if keep==m:
print("Yes")
res=1
break
if res=0:
print("No")
|
s306584055 | p03804 | u572343785 | 1588108698 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 634 | N,M = map(int,input().split())
A = [[0]]*(N+1)
A[N] = str("a")*50
B = [[0]]*M
for i in range(N):
A[i] = input()
for j in range(M):
B[j] = input()
judge = False
if M==1:
for j in range(M):
for i in range(N):
for k in range(N):
if B[j]==A[i][k]:
judge = True
count = 0
for i in range(N-M+1):
for j in range(M):
if B[j]==A[i][i:i+M] and B[j+1]==A[i+1][i:i+M]:
count += 1
if count == M - 1:
judge = True
break
if judge == True:
print("Yes")
else:
print("No") |
s165732842 | p03804 | u572343785 | 1588107201 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 461 | N,M = map(int,input().split())
A = [[0]]*(N+1)
A[N] = str("a")*50
B = [[0]]*M
for i in range(N):
A[i] = input()
for j in range(M):
B[j] = input()
judge = False
count = 0
for i in range(N-M+1):
for j in range(M):
if B[j]==A[i][i:i+M] and B[j+1]==A[i+1][i:i+M]:
count += 1
if count == M - 1:
judge = True
break
if judge == True:
print("Yes")
else:
print("No") |
s482120141 | p03804 | u572343785 | 1588106953 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 442 | N,M = map(int,input().split())
A = [[0]]*(N+1)
B = [[0]]*M
for i in range(N):
A[i] = input()
for j in range(M):
B[j] = input()
judge = False
count = 0
for i in range(N-M+1):
for j in range(M):
if B[j]==A[i][i:i+M] and B[j+1]==A[i+1][i:i+M]:
count += 1
if count == M - 1:
judge = True
break
if judge == True:
print("Yes")
else:
print("No") |
s670269189 | p03804 | u572343785 | 1588106668 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 416 | N,M = map(int,input().split())
A = [[0]]*(N+1)
B = [[0]]*M
for i in range(N):
A[i] = input()
for j in range(M):
B[j] = input()
count = 0
for i in range(N-M+1):
for j in range(M):
if B[j]==A[i][i:i+M] and B[j+1]==A[i+1][i:i+M]:
count += 1
if count == M - 1:
print("Yes")
break
if count != M-1 or count==0:
print("No") |
s396294996 | p03804 | u696444274 | 1588049090 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 354 | n = int(input())
# n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
check = False
for i in range(n):
if a[i] % 2 != 0:
check = True
break
count = 0
while check == False:
for i in range(n):
a[i] /= 2
if a[i] % 2 != 0:
check = True
break
count += 1
print(count)
|
s307141720 | p03804 | u373304480 | 1588030371 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 493 | import re
n,m = map(int, input().split())
a = [input().strip() for i in range(n)]
b = [input().strip() for i in range(m)]
mc = n-m+1
ans = False
for ai in range(0, mc):
if(ans):
break
ind = [x.start() for x in re.finditer(b[0], a[ai])]
for i in ind:
if(ans):
break
for bi in range(0, mc):
print(bi,a[ai+bi+1][i:i+m], b[bi+1])
if(a[ai+bi+1][i:i+m] != b[bi+1]):
break
if(bi==mc-1):
ans = True
if(ans):
print('Yes')
else:
print('No') |
s852829472 | p03804 | u373304480 | 1588029813 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3188 | 463 | import re
n,m = map(int, input().split())
a = [input().strip() for i in range(n)]
b = [input().strip() for i in range(m)]
mc = n-m+1
tb = [[0]*mc]*mc
ans = False
for ai in range(0, mc):
if(ans):
break
ind = [x.start() for x in re.finditer(b[0], a[ai])]
for i in ind:
if(ans):
break
for bi in range(1, mc):
if(a[ai+bi][i:i+m] != b[bi]):
break
if(bi==mc-1):
ans = True
if(ans):
print('Yes')
else:
print('No') |
s231704203 | p03804 | u373304480 | 1588029713 | Python | Python (3.4.3) | py | Runtime Error | 27 | 3316 | 463 | import re
n,m = map(int, input().split())
a = [input().strip() for i in range(n)]
b = [input().strip() for i in range(m)]
mc = n-m+1
tb = [[0]*mc]*mc
ans = False
for ai in range(0, mc):
if(ans):
break
ind = [m.start() for m in re.finditer(b[0], a[ai])]
for i in ind:
if(ans):
break
for bi in range(1, mc):
if(a[ai+bi][i:i+m] != b[bi]):
break
if(bi==mc-1):
ans = True
if(ans):
print('Yes')
else:
print('No') |
s232061141 | p03804 | u373304480 | 1588029475 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 464 | import re
n,m = map(int, input().split())
a = [input().strip() for i in range(n)]
b = [input().strip() for i in range(m)]
mc = n-m+1
tb = [[0]*mc]*mc
ans = False
for ai in range(0, mc):
if(ans):
break
ind = [m.start() for m in re.finditer(b[0], a[ai])]
for i in ind:
if(ans):
break
for bi in range(1, mc):
if(a[ai+bi][i:i+mc] != b[bi]):
break
if(bi==mc-1):
ans = True
if(ans):
print('Yes')
else:
print('No') |
s861302132 | p03804 | u502731482 | 1587864957 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 542 | 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):
for j in range(n):
if a[i][j] == b[0][0] and i + m - 1 < n and j + m - 1 < n:
flag = 1
for y in range(i, i + m):
for x in range(j, j + m):
if a[i + y][j + x] != b[y][x]:
flag = 0
break
if flag == 1:
print("Yes")
exit()
print("No")
|
s348665124 | p03804 | u502731482 | 1587864846 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 536 | 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):
for j in range(n):
if a[i][j] == b[0][0] and i + m <= n and j + m <= n:
flag = 1
for y in range(i, i + m):
for x in range(j, j + m):
if a[i + y][j + x] != b[y][x]:
flag = 0
break
if flag == 1:
print("Yes")
exit()
print("No")
|
s148505264 | p03804 | u703528810 | 1587601717 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 450 | N,M=map(int,input().split())
A=list(input() for _ in range(N))
B=list(input() for _ in range(M))
ans="No"
for y in range(N-M+1):
for x in range(N-M+1):
if A[y][x]==B[0][0]:
cond=True
for i in range(N-M):
if A[y+i][x:x+M]!=B[i]:
cond=False
break
if cond:
ans="Yes"
break
if ans=="Yes":
break
print(ans) |
s405687634 | p03804 | u703528810 | 1587600968 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 394 | N,M=map(int,input().split())
A=list(input() for _ in range(N))
B=list(input() for _ in range(M))
ans="No"
for y in range(N-M+1):
for x in range(N-M+1):
if A[y][x]==B[0][0]:
cond=True
for i in range(N-M):
if A[y+i][x:x+M]!=B[i]:
cond=False
break
if cond:
ans="Yes"
print(ans) |
s198981009 | p03804 | u461833298 | 1587473403 | Python | Python (3.4.3) | py | Runtime Error | 61 | 3064 | 465 | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
lenB = M**2
flg=False
def check(i, j):
cnt=0
for k in range(M):
for l in range(M):
if A[i+k][i+j] == B[k][l]:
cnt += 1
if cnt==M**2:
return True
for i in range(N-M+1):
for j in range(N-M+1):
if A[i][j] == B[0][0]:
flg = check(i, j)
ans='Yes' if flg else 'No'
print(ans) |
s937254006 | p03804 | u080986047 | 1587175530 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 38384 | 379 | n,m = map(int,input().split())
a = [list(input())for i in range(n)]
for y in range(n-m+1):
for z in range(n-m):
count = 0
for p in range(m):
if b[p] == a[y+p][z:(z+m)]:
count += 1
if count == m:
print("Yes")
exit()
else:
count = 0
print("No")
|
s528047844 | p03804 | u080986047 | 1587175005 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38640 | 541 | n,m = map(int,input().split())
a = [list(input())for i in range(n)]
for y in range(n-m+1):
#print(y)
for z in range(n-m+1):
count = 0
for p in range(m):
if b[p] == a[y+p][z:(z+m)]:
count += 1
#print("if")
#print(count)
if count == m:
print("Yes")
exit()
else:
count = 0
#print("else")
#print(count)
else:
print("No")
|
s482032094 | p03804 | u080986047 | 1587173847 | Python | PyPy3 (2.4.0) | py | Runtime Error | 179 | 39536 | 647 | 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-m+1):
#print(y)
for z in range(n-m+1):
for p in range(m):
if b[x+p] == a[y+p][z:(z+m)]:
count += 1
#print("elif")
#print(count)
if count == m:
print("Yes")
exit()
else:
count = 0
#print("else")
#print(count)
else:
print("No") |
s215220635 | p03804 | u080986047 | 1587172516 | Python | PyPy3 (2.4.0) | py | Runtime Error | 187 | 39536 | 521 | 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-m+1):
#print(y)
for z in range(n-m+1):
if b[x] == a[y][z:(z+m)]:
for p in range(m):
if b[x+p] == a[y+p][z:(z+m)]:
count += 1
if count == m-1:
print("Yes")
exit()
else:
print("No") |
s097647503 | p03804 | u080986047 | 1587171036 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 39024 | 518 | 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-m):
#print(y)
for z in range(n-m):
if b[x] == a[y][z:(z+m)]:
for p in range(m):
if b[x+p] == a[y+p][z:(z+m)]:
count += 1
if count == m-1:
print("Yes")
exit()
else:
print("No")
|
s926715895 | p03804 | u080986047 | 1587170900 | Python | PyPy3 (2.4.0) | py | Runtime Error | 192 | 39024 | 515 | 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-m):
#print(y)
for z in range(n-m):
if b[x] == a[y][z:(z+m)]:
for p in range(m):
if b[x+p] == a[y+p][z:(z+m)]:
count += 1
if count == m:
print("Yes")
exit()
else:
print("No") |
s867518030 | p03804 | u818349438 | 1587157637 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 577 | int main(void){
int N,M;
cin >> N >> M;
const int nmmax=50;
char A[nmmax][nmmax],B[nmmax][nmmax];
for(int y=0;y<N;++y){
for(int x=0;x<N;++x){
cin >> A[y][x];
}
}
for(int y=0;y<M;++y){
for(int x=0;x<M;++x){
cin >> B[y][x];
}
}
bool exist=false;
for(int ly=0;ly<N;++ly){
for(int lx=0;lx<N;++lx){
if(ly+M-1>=N or lx+M-1>=N) continue;
bool match=true;
for(int y=0;y<M;++y){
for(int x=0;x<M;++x){
if(A[ly+y][lx+x]!=B[y][x]) match=false;
}
}
if(match) exist=true;
}
}
if(exist)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.