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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s865017501 | p03565 | u329407311 | 1591999054 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 482 | S = list(input())
T = list(input())
ck = 0
tl = len(T)
arr = []
for i in range(len(S)):
a = S[i]
if a == T[ck] or a == "?":
ck += 1
else:
ck = 0
if tl == ck:
arr.append(i-tl+1)
if len(arr) == 0:
print("UNRESTORABLE")
else:
b = arr[-1]
ans = ""
for i in range(len(S)):
if i == b:
... |
s346980374 | p03565 | u951480280 | 1591978620 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 541 | s = input()
t = input()
num_s = len(s)
num_t = len(t)
idx_t = []
def match(s,i):
if s[i] == t[0]:
for j in range(num_t):
if s[i+j] not in (t[j],'?'):
return False
else:
return i
else:
return False
for i in range(num_s-num_t+1):
idx = match(s,i)
if idx != False:
idx_t.append(idx)
if len(idx_t) =... |
s541309022 | p03565 | u591503175 | 1591894141 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 420 | Sd = input()
T = input()
r_Sd = Sd[::-1]
r_T = T[::-1]
for i in range(len(Sd)- len(T)):
temp_words = r_Sd[i:i+len(T)]
res = r_Sd[0:i] + ''
for j in range(len(T)):
if temp_words[j] == '?' or temp_words[j] == r_T[j]:
res+=r_T[j]
else:
break
else:
res = res... |
s545512960 | p03565 | u591503175 | 1591894080 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 580 | def resolve():
'''
code here
'''
Sd = input()
T = input()
r_Sd = Sd[::-1]
r_T = T[::-1]
for i in range(len(Sd)- len(T)):
temp_words = r_Sd[i:i+len(T)]
res = r_Sd[0:i] + ''
for j in range(len(T)):
if temp_words[j] == '?' or temp_words[j] == r_T[j]:
... |
s866990777 | p03565 | u790012205 | 1591817412 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 505 | S = list(input())
T = list(input())
s = len(S)
t = len(T)
OK = False
P = 0
for i in range(s - t + 1):
if S[i] != T[0] and S[i] != '?':
continue
for j in range(1, t):
if S[i + j] != T[j] and S[i + j] != '?':
break
if j == t - 1:
OK = True
P = i
for k in... |
s121636049 | p03565 | u790012205 | 1591817338 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 528 | S = list(input())
T = list(input())
s = len(S)
t = len(T)
OK = False
P = 0
for i in range(s - t + 1):
if S[i] != T[0] and S[i] != '?':
continue
for j in range(1, t):
if S[i + j] != T[j] and S[i + j] != '?':
OK = False
break
if j == t - 1:
OK = True
... |
s986959319 | p03565 | u967822229 | 1591513254 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 526 | from math import floor
from decimal import Decimal
S = list(input())
T = list(input())
isSuccess = False
for i in reversed(range(len(S) - len(T) + 1)):
T_str = S[i: i + len(T)]
for j in range(len(T)):
if T_str[j] != T[j] and T_str[j] != "?":
break
else:
isSuccess = True
S[... |
s595187186 | p03565 | u266014018 | 1590906734 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 281 | s = input()
t = input()
s = s[::-1]
t = t[::-1]
for i in range(len(s)):
for j in range(len(t)):
if s[i+j] != t[j] and s[i+j] != '?':
break
else:
break
else:
print('UNSTORERABLE')
exit(0)
s = s[:i] + t + s[i+len(t):]
s = s.replace('?','a')
s = s[::-1]
print(s) |
s186064053 | p03565 | u266014018 | 1590906668 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 241 | s = input()
t = input()
s = s[::-1]
t = t[::-1]
for i in range(len(s)):
for j in range(len(t)):
if s[i+j] != t[j] and s[i+j] != '?':
break
else:
break
s = s[:i] + t + s[i+len(t):]
s = s.replace('?','a')
s = s[::-1]
print(s) |
s339880051 | p03565 | u047197186 | 1590687050 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 606 | s = input()
t = input()
flag = 0
if t in s:
s = s.replace('?', 'a')
print(s)
flag = 1
if '?' * len(t) in s:
s = s[::-1]
s = s.replace((t[:i] + '?' * (len(t) - i))[::-1], t[::-1], 1)
s = s.replace('?', 'a')
print(s[::-1])
flag = 1
if flag == 0:
for i in range(0, len(t)):
for j in range(... |
s456791200 | p03565 | u985949234 | 1590572869 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38384 | 670 | S = str(input())
T = str(input())
termi = len(S)
tab= len(T)
result = []
def rec(r,st):
if r >= termi:
result.append(st)
else:
if S[r] =='?':
rec(r+1,st+'a')
elif S[r] == T[0]:
rec(r+tab,st+T)
rec(r+1,st+'a')
else:
rec(r+1,st+S[r]... |
s482404146 | p03565 | u982591663 | 1590413698 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3320 | 2426 | S = list(input())
N = len(S)
T = input()
M = len(T)
ans = "UNRESTORABLE"
def changehatena(S):
S = "".join(S)
S = S.replace("?", "a")
return S
def check_after(S, i):
try:
if S[i+1] == T[-1]:
return True
else:
return False
except:
return False
def ch... |
s850695867 | p03565 | u119982001 | 1590201019 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 38384 | 555 | S = input()
T = input()
tmp = 'UNRESTORABLE'
ans = []
flag = True
for i in range(len(S)):
if S[i] == T[0]:
for j in range(0, len(T)):
if S[i+j] != T[j] and S[i+j] != '?':
flag = False
ans.append(T[j])
elif len(ans) < len(S):
if S[i] == '?':
... |
s288974743 | p03565 | u379142263 | 1590135278 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 572 | s = list(input())
t = list(input())
for i in range(len(s)-len(t)+1):
flag = False
if s[i] == "?" or s[i] == t[0]:
for j in range(len(t)):
if s[i+j] == t[j] or s[i+j] == "?":
flag = True
else:
flag = False
break
if flag == T... |
s060902869 | p03565 | u091489347 | 1589958545 | Python | Python (3.4.3) | py | Runtime Error | 28 | 3572 | 438 | import copy
import sys
li = list('abcdefghijklmnopqrstuvwxyz')
r = []
for i in range(len(s)-len(t)+1):
ss = list(s)
print(i)
lo = [1 if ((s[i + j] == t[j]) or (s[i + j] == '?')) else 0 for j in range(len(t))]
print(lo)
if all(lo):
ss[i:i+ len(t)] = t
rs = ''.join(ss)
rs = rs.... |
s487154930 | p03565 | u970082363 | 1589915877 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 608 | s = list(map(str,input()))
t = list(map(str,input()))
m = len(s)
n = len(t)
ans = []
if m<n:
print("UNRESROEABLE")
else:
for i in range(m-n+2):
s1 = s[i:i+n]
s2 = s
flag = True
for j in range(n):
if s1[j]!="?" and s1[j]!=t[j]:
flag = False
... |
s427529422 | p03565 | u626467464 | 1589785324 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 625 | sn = list(input())
t = list(input())
ls = len(sn)
lt = len(t)
Flag = False
reali = 0 #tの文が始まるときのi
for i in range(ls-lt+1): #スライスを繰り返して当てはまるところを探す
ss = sn[i:i+lt]
count = 0
for j in range(lt):
if ss[j] == "?" or ss[j] == t[j]:
count += 1
if count == lt:
reali = i
Flag = True
break
for i in ... |
s400893630 | p03565 | u626467464 | 1589783795 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 465 | sn = list(input())
t = list(input())
ls = len(sn)
lt = len(t)
Flag = False
reali = 0
for i in range(ls-lt+1):
ss = sn[i:i+lt]
count = 0
for j in range(lt):
if ss[j] == "?" or ss[j] == t[j]:
count += 1
if count == lt:
reali = i
Flag = True
break
for i in range(ls):
if i == reali:
for ... |
s621975343 | p03565 | u811436126 | 1589667241 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 437 | s = input()
t = input()
n = len(s)
m = len(t)
for i in range(n - m + 1):
bubun = s[i:i + m]
flag = True
for j in range(m):
x = bubun[j]
y = t[j]
if x == y:
pass
elif x == '?':
pass
else:
flag = False
if flag:
ans = s[... |
s672395716 | p03565 | u885634168 | 1589663371 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38256 | 740 | S = input()
T = input()
S_length = len(S)
T_length = len(T)
if S_length < T_length:
print("UNRESTORABLE")
elif S_length == T_length:
for i in range(T_length):
if S[i] != "?" and S[i] != T[j]:
break
else:
print(T)
else:
flag = 0
for i in range(S_length - T_leng... |
s987574788 | p03565 | u755801379 | 1589656501 | Python | PyPy3 (2.4.0) | py | Runtime Error | 163 | 38384 | 376 | zS=input()
T=input()
ls=len(S)
lt=len(T)
ans='UNRESTORABLE'
if ls<lt:
print(ans)
exit()
for i in range(ls-lt,-1,-1):
c=0
for j in range(lt):
if T[j]==S[i+j] or S[i+j]=='?':
continue
else:
c=1
break
if c==0:
ans=S.replace('?','a')
... |
s707452811 | p03565 | u755801379 | 1589655663 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38256 | 359 | S=input()
T=input()
ls=len(S)
lt=len(T)
ans='UNRESTORABLE'
if ls<lt:
print(ans)
exit()
for i in range(ls-lt,0,-1):
c=0
for j in range(lt):
if T[j]==S[i+j] or S[i+j]=='?':
continue
else:
c=1
break
if c==0:
ans=S.replace('?','a')
an... |
s425785063 | p03565 | u324197506 | 1589587356 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 670 | def check(c,t):
if len(c) < len(t):
return False
for i in range(len(t)):
if c[i] != "?" and c[i] != t[i]:
return False
return True
i = 0
Has = False
ans = ""
while i < len(s):
if (s[i] == "?" or s[i] == t[0]) and not Has:
if check(s[i:],t):
Has... |
s634615541 | p03565 | u549383771 | 1589511384 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 591 | s = input()
t = input()
ans_list = []
if t in s:
print(s.replace('?', 'a'))
else:
for i in range(len(s) - len(t),-1,-1):
flag = True
for j in range(len(t)):
if s[j] == t[j - i] or s[j] == '?':
continue
else:
flag = False
br... |
s260250733 | p03565 | u549383771 | 1589511360 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 597 | s = input()
t = input()
ans_list = []
if t in s:
print(s.replace('?', 'a'))
else:
for i in range(len(s) - len(t),-1,-1)[::-1]:
flag = True
for j in range(len(t)):
if s[j] == t[j - i] or s[j] == '?':
continue
else:
flag = False
... |
s586414786 | p03565 | u549383771 | 1589511322 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 601 | s = input()
t = input()
ans_list = []
if t in s:
print(s.replace('?', 'a'))
else:
for i in range(0 , len(s) - len(t),-1,-1)[::-1]:
flag = True
for j in range(len(t)):
if s[j] == t[j - i] or s[j] == '?':
continue
else:
flag = False
... |
s568800910 | p03565 | u025287757 | 1589490963 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 664 | def main():
s = str(input())
ans = s.replace('?', 'z')
flag = False
t = str(input())
for i in range(len(s)-len(t)+1):
temp_flag = True
temp_ans = list(s)
for j in range(len(t)):
if s[i + j] == '?':
temp_ans[i + j] = t[j]
continue
elif s[i+j] != t[j]:
temp_flag =... |
s514204506 | p03565 | u812576525 | 1589334213 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 526 | S = input()
T = input()
st = len(S)
lt = len(T)
for i in range(st):
if len(S[i:i + lt ]) < lt :
break
else:
#print(S[i:i + lt +1])
X = S[i:i + lt ]
Y =[]
A = S[:i]
B = S[i+lt:]
for x, t in zip(X,T):
if x == t or x == '?':
Y.app... |
s375430546 | p03565 | u539826121 | 1589230771 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1266 | //----------------------------------------------------------------------
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<... |
s127528872 | p03565 | u703528810 | 1589226550 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 409 | S=input()
T=input()
SL=list(S)
N=len(S)
M=len(T)
for i in range(N-M+1):
cond=True
temp=S[N-M-i:N-i]
for s in range(M):
if temp[s]!="?" and temp[s]!=T[s]:
cond=False
if cond:
SL[N-M-i:N-i]=list(T)
break
if not cond:
print("UNRESTORABLE")
else:
for j in range(N... |
s808128592 | p03565 | u747602774 | 1589094526 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 442 | S = input()
T = input()
N = len(S)
M = len(T)
if N < M:
print('UNRESTORABLE')
else:
ans = 'UNRESTORABLE'
for i in range(N-M+1):
make = True
for j in range(M):
if S[i+j] != '?' and S[i+j] != T[j]:
make = 0
if make:
ans = S[:i] + T + S[i+... |
s782172419 | p03565 | u747602774 | 1589094317 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 391 | S = input()
T = input()
N = len(S)
M = len(T)
if N < M:
print('UNRESTORABLE')
exit()
ans = 'UNRESTORABLE'
for i in range(N-M+1):
make = True
for j in range(M):
if S[i+j] != '?' and S[i+j] != T[j]:
make = 0
if make:
ans = S[:i] + T + S[i+M:]
ans = list(ans)
for i in ran... |
s673285907 | p03565 | u747602774 | 1589094007 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 423 | S = input()
T = input()
N = len(S)
M = len(T)
if N < M:
print('UNRESTORABLE')
exit()
ans = 'UNRESTORABLE'
for i in range(N-M+1):
make = True
for j in range(M):
if S[i+j] == '?':
continue
if S[i+j] != T[j]:
make = False
if make:
ans = S[:i] + T + S[i... |
s597369016 | p03565 | u747602774 | 1589093568 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 432 | S = input()
T = input()
N = len(S)
M = len(T)
if N < M:
print('UNRESTORABLE')
exit()
ans = 'UNRESTORABLE'
for i in range(N-M,-1,-1):
make = True
for j in range(M):
if S[i+j] == '?':
continue
if S[i+j] != T[j]:
make = False
if make:
ans = list(S[:i] ... |
s529600216 | p03565 | u747602774 | 1589090513 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 594 | S = list(input())
T = list(input())
N = len(S)
M = len(T)
ans = 'UNRESTORABLE'
if N < M:
print(ans)
exit()
if N == M:
ans = S
for i in range(N):
if S[i] == '?':
S[i] = T[i]
else:
if S[i] != T[i]:
ans = 'UNRESTORABLE'
print(ans)
exit()
... |
s450877390 | p03565 | u747602774 | 1589089821 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 411 | S = input()
T = input()
N = len(S)
M = len(T)
ans = 'UNRESTORABLE'
if N < M:
print(ans)
exit()
for i in range(N-M,-1,-1):
b = True
for j in range(M):
if S[i+j] == '?' or S[i+j] == T[j]:
continue
b = False
if b:
ans = S[:i] + T + S[i+j+1:]
break
ans = l... |
s099640441 | p03565 | u747602774 | 1589089752 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 373 | S = input()
T = input()
N = len(S)
M = len(T)
ans = 'UNRESTORABLE'
for i in range(N-M,-1,-1):
b = True
for j in range(M):
if S[i+j] == '?' or S[i+j] == T[j]:
continue
b = False
if b:
ans = S[:i] + T + S[i+j+1:]
break
ans = list(ans)
for i in range(N):
if ans... |
s311269691 | p03565 | u423665486 | 1588991251 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38384 | 506 | def check(s, t):
for i in range(len(s)):
if s[i] == t[i] or s[i] == '?':
continue
return False
return True
def norm(s):
ans = []
for i in s:
ans.append('a' if i == '?' else i)
ans[0] = 'a'
return "".join(ans)
def resolve():
s = list(input())
t = list(input())
if len(s) < len(t):
print('UNRESTORABL... |
s485397560 | p03565 | u423665486 | 1588991110 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38256 | 452 | def check(s, t):
for i in range(len(s)):
if s[i] == t[i] or s[i] == '?':
continue
return False
return True
def norm(s):
ans = []
for i in s:
ans.append('a' if i == '?' else i)
ans[0] = 'a'
return "".join(ans)
def resolve():
s = list(input())
t = list(input())
for i in range(len(s) - len(t) + 1):
i... |
s153466602 | p03565 | u606146341 | 1588762165 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 413 | s = str(input())
t = str(input())
lst = []
i= 0
for ss in range(len(s)-len(t)+1):
flg = 1
i= 0
for tt in range(len(t)):
now = ss + tt
if s[now] == t[tt] or s[now] == '?':
pass
else:
flg = 0
if flg:
ns = list(s)
ns[ss:now+1] = list(t)
lst.append(("").join(ns))
if lst:
lst = ... |
s722162436 | p03565 | u606146341 | 1588762145 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 486 | s = str(input())
t = str(input())
lst = []
i= 0
for ss in range(len(s)-len(t)+1):
flg = 1
i= 0
for tt in range(len(t)):
now = ss + tt
print(now)
if s[now] == t[tt] or s[now] == '?':
pass
else:
flg = 0
if flg:
print(ss, ss+tt+1)
print(s[ss:ss+tt+1])
ns = list(s)
ns[ss:... |
s496647169 | p03565 | u606146341 | 1588759651 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 447 | import sys
s = str(input())
t = str(input())
lst = []
i= 0
if len(s) < len(t):
print('UNRESTORABLE')
sys.exit()
else:
for _ in range(len(s)):
if s[_] == t[i] or s[_] == '?':
i += 1
else:
i = 0
if i == len(t):
pt = _ - i + 1
s = s.replace(s[pt:_ + 1],t)
... |
s749112548 | p03565 | u606146341 | 1588759446 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 376 | s = str(input())
t = str(input())
lst = []
i= 0
flg = 1
for _ in range(len(s)):
if s[_] == t[i] or s[_] == '?':
i += 1
else:
i = 0
if i == len(t):
pt = _ - i + 1
s = s.replace(s[pt:_ + 1],t)
lst.append(s)
if lst:
lst = [_.replace('?','a') for _ in lst]
so... |
s758292826 | p03565 | u035901835 | 1588717283 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 557 | Sd=input()
T=input()
i=len(Sd)-len(T)
j=0
ans=[]
flag=False
while(1):
#print('searching',i,j,Sd[i],T[j])
if Sd[i]==T[j] or Sd[i]=='?':
#print('find',i,j,Sd[i],T[j])
if j==len(T)-1:
ans.append((Sd[:i-j]+T+Sd[i-j+len(T):]).replace('?','a'))
i-=j+1
j=0
... |
s046373303 | p03565 | u035901835 | 1588717258 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 553 | Sd=input()
T=input()
i=len(Sd)-len(T)
j=0
ans=[]
flag=False
while(1):
#print('searching',i,j,Sd[i],T[j])
if Sd[i]==T[j] or Sd[i]=='?':
#print('find',i,j,Sd[i],T[j])
if j==len(T)-1:
ans.append((Sd[:i-j]+T+Sd[i-j+len(T):]).replace('?','a'))
i-=j+1
j=0
... |
s490125780 | p03565 | u035901835 | 1588717028 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 606 | Sd=input()
T=input()
flag=False
i=len(Sd)-len(T)
j=0
ans=[]
while(1):
#print('searching',i,j,Sd[i],T[j])
if Sd[i]==T[j] or Sd[i]=='?':
#print('find',i,j,Sd[i],T[j])
if j==len(T)-1:
ans.append((Sd[:i-j]+T+Sd[i-j+len(T):]).replace('?','a'))
#print('complete')
i... |
s867461810 | p03565 | u035901835 | 1588716995 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 602 | Sd=input()
T=input()
flag=False
i=len(Sd)-len(T)
j=0
ans=[]
while(1):
#print('searching',i,j,Sd[i],T[j])
if Sd[i]==T[j] or Sd[i]=='?':
#print('find',i,j,Sd[i],T[j])
if j==len(T)-1:
ans.append((Sd[:i-j]+T+Sd[i-j+len(T):]).replace('?','a'))
#print('complete')
i... |
s910894125 | p03565 | u511379665 | 1588021910 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 944 | #tempt
s=input()
t=input()
lt=len(t)
ls=len(s)
cnt=0
flag=True
for i in range(lt):
for j in range(ls):
if t[i]==s[j]:
bs=j
bt=i
af=j
at=j
check=True
while bs>0 and bt>0: #before
if s[bs]=="?" or s[bs]==t[bt]:
... |
s465613990 | p03565 | u158617964 | 1587938536 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 681 | S = input()
T = input()
Ns = len(S)
Nt = len(T)
if Ns<Nt:
print("UNRESTORABLE")
else:
S_merge=""
isok = True
for i in range(Ns-Nt,-1,-1):
isok = True
# print(S[i:i+Nt], T)
for j in range(Nt):
if not (S[i+j] == T[j] or S[i+j]=="?"):
isok = False
break
... |
s601040885 | p03565 | u158617964 | 1587937956 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 680 | S = input()
T = input()
Ns = len(S)
Nt = len(T)
if Ns<Nt:
print("UNRESTORABLE")
else:
S_merge=""
isok = True
for i in range(Ns-Nt,-1,-1):
isok = True
# print(S[i:i+Nt], T)
for j in range(Nt):
if not (S[i+j] == T[j] or S[i+j]=="?"):
isok = False
continue
... |
s883069299 | p03565 | u158617964 | 1587937642 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 644 | S = input()
T = input()
Ns = len(S)
Nt = len(T)
if Ns<Nt:
print("UNRESTORABLE")
else:
S_merge=""
for i in range(Ns-Nt,0,-1):
isok = True
# print(S[i:i+Nt], T)
for j in range(Nt):
if not (S[i+j] == T[j] or S[i+j]=="?"):
isok = False
continue
if isok:
... |
s540647870 | p03565 | u576432509 | 1587917874 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 868 |
sd=list(input())
t=list(input())
#strsd="?tc????"
#strt="coder"
#strsd="??p??d??"
#strt="abc"
#strsd="ab??p??c"
#strt="abc"
#sd=list(strsd)
#t=list(strt)
lens=len(sd)
lent=len(t)
yn=""
for i in range(lens-lent,-1,-1):
yn=""
for ii in range(lent):
if sd[i+ii]==t[ii] or sd[i+ii]=="?":
con... |
s036836296 | p03565 | u576432509 | 1587917429 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 829 | sd=list(input())
t=list(input())
#strsd="?tc????"
#strt="coder"
#strsd="??p??d??"
#strt="abc"
#sd=list(strsd)
#t=list(strt)
lens=len(sd)
lent=len(t)
for i in range(lens-lent,-1,-1):
yn=""
for ii in range(lent):
if sd[i+ii]==t[ii] or sd[i+ii]=="?":
continue
else:
yn="NG... |
s356669133 | p03565 | u576432509 | 1587916853 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 829 | sd=list(input())
t=list(input())
#strsd="?tc????"
#strt="coder"
#strsd="??p??d??"
#strt="abc"
#sd=list(strsd)
#t=list(strt)
lens=len(sd)
lent=len(t)
for i in range(lens-lent,-1,-1):
yn=""
for ii in range(lent):
if sd[i+ii]==t[ii] or sd[i+ii]=="?":
continue
else:
yn="NG... |
s058571338 | p03565 | u114366889 | 1587611284 | Python | Python (3.4.3) | py | Runtime Error | 280 | 18640 | 495 | import numpy as np
import sys
S_ = np.array(list(input()))
T = np.array(list(input()))
for i in range(-1,-1*(abs(len(S_) - len(T))+2), -1):
for j in range(-1,-1*(len(T)+1),-1):
if S_[i+j+1] == '?' or S_[i+j+1] == T[j]:
if j == -1*(len(T)):
S = S_[:i+j+1]
S = np... |
s387072703 | p03565 | u536600145 | 1587602302 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 350 | import re
word = '?tc????'.replace('?','.')
substring = 'coder'
N = len(word) - len(substring)
found = False
for i in range(N+1):
regexp = re.compile(word[i:i+len(substring)])
if regexp.search(substring):
found = True
res = word[0:i] + substring
print(res.replace('.','a'))
if found = Fa... |
s244186061 | p03565 | u707498674 | 1587343702 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 581 | def main():
S = list(input())
T = list(input())
for i in range(max(0, len(S)-len(T)+1)):
ans = ""
for j in range(i):
if S[j] == "?":
ans += "a"
else:
ans += S[j]
for j in range(i, len(S)):
if S[j] == T[j-i]:
... |
s519927633 | p03565 | u707498674 | 1587343588 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 585 | def main():
S = list(input())
T = list(input())
for i in range(len(S)-len(T)+1):
ans = ""
for j in range(i):
if S[j] == "?":
ans += "a"
else:
ans += S[j]
for j in range(i, len(S)):
if S[j] == T[j-i]:
... |
s877544972 | p03565 | u152509702 | 1587323704 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 328 | S = input()
T = input()
n = len(S)
m = len(T)
s = []
for i in reversed(range(n - m + 1)):
t_kamo = S[i: i + m]
for j in range(m + 1):
if j == m:
print((S[:i] + T + S[i + m:]).replace("?", "a"))
exit()
if t_kamo[j] == "?":
continue
elif t_kamo[j] != t[j]:
break
print("UNRESTO... |
s266091662 | p03565 | u152509702 | 1587319914 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 619 | S = list(input())
T = list(input())
flag = False
if "".join(map(str, T)) in "".join(map(str, S)):
for i in range(len(S)):
if S[i] == "?":
S[i] = "a"
print("".join(map(str,S)))
else:
for i in reversed(range(len(S) - len(T) + 1)):
if S[i] == (T[0] or "?"):
for j in range(len(T)):
... |
s866347840 | p03565 | u134712256 | 1587264950 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 492 | s=input()
t=input()
s_list=["" for i in range(len(s))]
t_list=["" for i in range(len(t))]
for i in range(len(s)):
s_list[i]=s[i]
for i in range(len(t)):
t_list[i]=t[i]
flag=True
if len(s)<len(t):
print(t)
exit()
for i in range(len(s)):
if s[i]==t[0]:
for j in range(1,len(t)):
if s[i+j]!=t[j] and... |
s328585469 | p03565 | u134712256 | 1587263493 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 454 | s=input()
t=input()
s_list=["" for i in range(len(s))]
t_list=["" for i in range(len(t))]
for i in range(len(s)):
s_list[i]=s[i]
for i in range(len(t)):
t_list[i]=t[i]
flag=True
for i in range(len(s)):
if s[i]==t[0]:
for j in range(1,len(t)):
if s[i+j]!=t[j] and s[i+j]!='?':
flag=False
i... |
s605023778 | p03565 | u588794534 | 1587251394 | Python | PyPy3 (2.4.0) | py | Runtime Error | 188 | 38256 | 388 | #https://atcoder.jp/contests/abc076/tasks/abc076_c
s=input()
t=input()
for i in range(len(s)-len(t)+1):
flag=0
n= len(s)-i-len(t)
temp=s[n:n+len(t)]
for j in range(len(t)):
if temp[j]!=t[j] and temp[j]!="?":
flag=1
if flag==0:
break
if flag==1:
print("UNRESTORABLE"... |
s311923355 | p03565 | u502731482 | 1587244932 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 786 | s = input()
t = input()
ans = s
for i in range(len(t)):
for j in range(len(s)):
ans = list(s)
flag = True
if t[i] == s[j]:
for k in range(i + 1, len(t)):
if t[i + k] != s[j + k] and s[j + k] != "?":
flag = False
break
... |
s322183978 | p03565 | u486990800 | 1587234951 | Python | Python (3.4.3) | py | Runtime Error | 149 | 12404 | 748 | import sys
import numpy as np
input = sys.stdin.readline
S_ = input()
T = input()
S_ = list(S_)[:-1]
T = list(T)[:-1]
for i in range(len(S_)-len(T)+1):
if i==0:
part = S_[-len(T):]
else :
part = S_[-len(T)-i:-i]
j = False
for k in range(len(part)-1,-1,-1):
if part[k] == "?"... |
s167109535 | p03565 | u486990800 | 1587234166 | Python | Python (3.4.3) | py | Runtime Error | 152 | 12520 | 673 | import sys
import numpy as np
input = sys.stdin.readline
S_ = input()
T = input()
S_ = list(S_)[:-1]
T = list(T)[:-1]
for i in range(len(S_)-len(T)+1):
part = S_[-len(T)-i:-i]
j = False
for k in range(len(part)-1,-1,-1):
if part[k] == "?":
if k==0:
j = True
... |
s139504853 | p03565 | u486990800 | 1587234045 | Python | Python (3.4.3) | py | Runtime Error | 153 | 12520 | 668 | import sys
import numpy as np
input = sys.stdin.readline
S_ = input()
T = input()
S_ = list(S_)[:-1]
T = list(T)[:-1]
for i in range(len(S_)-len(T)+1):
part = S_[-len(T):]
j = False
for k in range(len(part)-1,-1,-1):
if part[k] == "?":
if k==0:
j = True
elif... |
s641130284 | p03565 | u486990800 | 1587233816 | Python | Python (3.4.3) | py | Runtime Error | 156 | 12424 | 643 | import sys
import numpy as np
input = sys.stdin.readline
S_ = input()
T = input()
S_ = list(S_)[:-1]
T = list(T)[:-1]
for i in range(len(S_)-len(T)+1):
part = S_[-len(T):]
j = False
for k in range(len(part)-1,-1,-1):
if part[k] == "?":
continue
elif part[k] == T[k]:
... |
s928425158 | p03565 | u207097826 | 1587216265 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 38256 | 626 | S_dash = list(input())
M = len(S_dash)
T = list(input())
N = len(T)
match = [False for _ in range(M)]
last_match = -100
for i in range(M - N + 1):
for j in range(N):
if S_dash[i+j] == "?":
continue
elif S_dash[i+j] == T[j]:
continue
elif S_dash[i+j] != T[j]:
... |
s664172673 | p03565 | u207097826 | 1587216201 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38384 | 627 |
S_dash = list(input())
M = len(S_dash)
T = list(input())
N = len(T)
match = [False for _ in range(M)]
last_match = -100
for i in range(M - N + 1):
for j in range(N):
if S_dash[i+j] == "?":
continue
elif S_dash[i+j] == T[j]:
continue
elif S_dash[i+j] != T[j]:
... |
s839460027 | p03565 | u207097826 | 1587216111 | Python | PyPy3 (2.4.0) | py | Runtime Error | 186 | 38384 | 627 |
S_dash = list(input())
M = len(S_dash)
T = list(input())
N = len(T)
match = [False for _ in range(M)]
last_match = -100
for i in range(M - N + 1):
for j in range(N):
if S_dash[i+j] == "?":
continue
elif S_dash[i+j] == T[j]:
continue
elif S_dash[i+j] != T[j]:
... |
s875711173 | p03565 | u207097826 | 1587215923 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38512 | 599 | S_dash = list(input())
M = len(S_dash)
T = list(input())
N = len(T)
match = [False for _ in range(M)]
last_match = -100
for i in range(M - N + 1):
for j in range(N):
if S_dash[i+j] == "?":
continue
elif S_dash[i+j] == T[j]:
continue
elif S_dash[i+j] != T[j]:
... |
s066491995 | p03565 | u397384480 | 1587172746 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38512 | 626 | S = list(input())
T = list(input())
N = len(S)
M = len(T)
l = []
flag = 0
exist = 0
for i in range(N-M+1):
flag = 0
for j in range(M):
if T[j] != S[i+j] and S[i+j] != "?":
flag += 1
if flag == 0:
tmp = S.copy()
for k in range(M):
tmp[i+k] = T[k]
l.app... |
s995016523 | p03565 | u971124021 | 1586968821 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 534 | s = input()
t = input()
s = [x for x in s[::-1]]
t = [x for x in t[::-1]]
for i in range(len(s)-len(t)):
flg = False
cnt = 0
for j in range(len(t)):
if s[i+j] == '?':
cnt += 1
continue
if s[i+j] == t[j]:
flg = True
else:
flg = False
break
if flg or cnt == len(t):
... |
s286611943 | p03565 | u652569315 | 1586907975 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 459 | s=list(input())
t=list(input())
S,T=len(s),len(t)
t=t+['?']
if S<T:
print('UNRESTORABLE')
exit()
c,p=[0]*S,s[::-1]
for i in range(T+1):
if t[i] in p:
x=S-p.index(t[i])-1
c[x-i]=1 if all(s[x-i+j]=='?' or s[x-i+j]==t[j] for j in range(T)) else 0
if max(c)==0:
print('UNRESTORABLE')
exit()
c=c[::-1]
x,j=S... |
s729344038 | p03565 | u669173971 | 1586906337 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 406 | s=list(input())
t=list(input())
a=-1
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if s[j+i]!=t[j] and s[j+i]!='?':
break
if (s[j+i]==t[j] or s[j+i]=='?') and j==len(t)-1:
a=i
if a<0:
print('UNRESTORABLE')
else:
for i in range(len(s)):
if i>=a:
... |
s575396750 | p03565 | u669173971 | 1586905997 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 405 | s=list(input())
t=list(input())
a=-1
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if s[j+i]!=t[j] and s[j+i]!='?':
break
if (s[j+i]=='?' or s[j+i]=='?') and j==len(t)-1:
a=i
if a<0:
print('UNRESTORABLE')
else:
for i in range(len(s)):
if i>=a:
... |
s643913182 | p03565 | u268792407 | 1586726549 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 424 | s=input()
t=input()
n=len(s)
m=len(t)
li=[]
for i in range(n-m+1):
u=s[i:i+m]
c=0
for j in range(m):
if u[j]!="?" and u[j]!=t[j]:
c=1
break
if c==0:
if i==0:
v=t+s[i+m]
elif i==n-m:
v=s[:i]+t
else:
v=s[:i]+t+s[i+m]
for k in range(n):
if v[k]=="?":
... |
s749109715 | p03565 | u268792407 | 1586726513 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 423 | =input()
t=input()
n=len(s)
m=len(t)
li=[]
for i in range(n-m+1):
u=s[i:i+m]
c=0
for j in range(m):
if u[j]!="?" and u[j]!=t[j]:
c=1
break
if c==0:
if i==0:
v=t+s[i+m]
elif i==n-m:
v=s[:i]+t
else:
v=s[:i]+t+s[i+m]
for k in range(n):
if v[k]=="?":
v... |
s686592687 | p03565 | u935558307 | 1586697650 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 316 | S = input()
T = input()
lenS = len(S)
lenT = len(T)
ans = ""
for i in range(lenS-lenT,-1,-1):
for j in range(lenT):
if S[i+j]!=T[j] and S[i+j]!="?":
break
else:
ans = S[:i]+T+S[i+lenT:]
ans = ans.replace("?","a")
print(ans)
sys.exit()
print("UNRESTORABLE") |
s444418746 | p03565 | u151005508 | 1586626985 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3444 | 747 | import copy
S = list(input())
T = input()
ans = ''
for i in range(len(S)):
if S[i] == T[0] or S[i] == '?':
j = 0
while S[i + j] == T[j] or S[i + j] == '?':
#print(i, j)
j += 1
if i + j >= len(S):
break
if j == len(T) - 1 and (S[i + j]... |
s383295418 | p03565 | u698919163 | 1586558740 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 463 | S = input()
T = input()
sl = len(S)
tl = len(T)
for i in range(sl-tl+1):
s = S[i:i+tl]
flag = True
for j in range(tl):
if s[j] == '?':
continue
elif s[j] == T[j] and s[j] != '?':
continue
flag = False
break
if flag == Tr... |
s942846523 | p03565 | u698919163 | 1586558439 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 498 | S = input()
T = input()
sl = len(S)
tl = len(T)
for i in range(sl-tl+1):
s = S[i:i+tl]
flag = True
for j in range(tl):
if s[j] == T[j]:
continue
elif s[j] == '?':
continue
elif s[j] != T[j] and s[j] != '?':
flag = False
break
... |
s088904611 | p03565 | u556589653 | 1586553459 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1543 | S = input()
T = input()
#文字列判定
if len(S)<len(T):
#TがSより長いとき、Tが入るSは見当たらない
print("UNRESTORABLE")
#len(S) == len(T)のとき
elif len(S) == len(T):
flag = 0
#かぶったら加算をおこなうフラグ関数
for i in range(len(S)):
if S[i] == T[i] or S[i] == "?":
continue
else:
print("UNRESTORABLE")
... |
s558163029 | p03565 | u556589653 | 1586550209 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1544 | S = input()
T = input()
#文字列判定
if len(S)<len(T):
#TがSより長いとき、Tが入るSは見当たらない
print("UNRESTORABLE")
#len(S) == len(T)のとき
elif len(S) == len(T):
flag = 0
#かぶったら加算をおこなうフラグ関数
for i in range(len(S)):
if S[i] == T[i] or S[i] == "?":
continue
else:
print("UNRESTORABLE")
... |
s630753346 | p03565 | u556589653 | 1586549191 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1012 | S = input()
T = input()
flag_1 = 0
now = 0
count = 0
position = 0
position_2 = 0
flag_2 = 0
flag_3 = 0
if len(S)<len(T):
flag_3 += 1
for i in range(len(S)):
if S[i] == T[now]:
now += 1
flag_1 = 1
position = i
elif S[i] == "?":
count += 1
if flag_1 == 0:
po... |
s957135672 | p03565 | u556589653 | 1586548711 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 907 | S = input()
T = input()
flag_1 = 0
now = 0
count = 0
position = 0
position_2 = 0
flag_2 = 0
for i in range(len(S)):
if S[i] == T[now]:
now += 1
flag_1 = 1
position = i
elif S[i] == "?":
count += 1
if flag_1 == 0:
position = i
flag_1 = 1
els... |
s008649423 | p03565 | u801049006 | 1586542733 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 475 | s = input()
t = input()
result = []
for i in range(len(s)-len(t)+1):
temp = '?'*i + t + '?'*(len(s)-len(t)-i)
ans = ''
flag = True
for j in range(len(s)):
if s[j] == '?' or s[j] == temp[j]:
ans += temp[j]
elif s[j] != '?' and temp[j] == '?':
ans += s[j]
... |
s670232387 | p03565 | u516566941 | 1586373770 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 518 | s = list(input())
t = list(input())
count = 0
n = 0
ans = []
flag = 0
while n <len(s)-len(t)+1:
count = 0
for m in range(len(t)):
if s[n+m] == "?" or s[n+m]==t[m]:
count += 1
if count == len(t):
flag = 1
ans = s[0:n+m+1]
break
n += 1
#print(n,m)
if flag == 1:... |
s515684352 | p03565 | u641406334 | 1586360988 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 393 | s=input().replace('\n', '')
t=input().replace('\n', '')
begin, end = len(s) - len(t), len(s)
ans=''
while begin>=0:
origin = s[begin:end]
flag=1
for i in range(len(t)):
if origin[i]!=t[i] and origin[i]!='?':
flag=0
break
if flag:
ans = s[:begin]+t+s[end:]
begi... |
s195683417 | p03565 | u641406334 | 1586360960 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 411 | s=input().replace('\n', '')
t=input().replace('\n', '')
begin, end = len(s) - len(t), len(s)
ans=''
while begin>=0:
origin = s[begin:end]
print(origin)
flag=1
for i in range(len(t)):
if origin[i]!=t[i] and origin[i]!='?':
flag=0
break
if flag:
ans = s[:begin]+... |
s724083857 | p03565 | u605748139 | 1586236260 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3444 | 448 | from copy import deepcopy
aps_S = input()
T = input()
S = deepcopy(aps_S)
for i in range(len(aps_S) - len(T) + 1):
matched_flag = True
for j in range(len(T)):
if aps_S[-i-j-1] != T[-j-1] and aps_S[i-j] != '?':
matched_flag = False
continue
if matched_flag:
S[-i-l... |
s261629993 | p03565 | u454557108 | 1586181115 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 381 | import sys
s = input()
t = input()
tl = len(t) ; sl = len(s)
for i in range(sl,tl-1,-1) :
st = s[i-tl:i]
c = 0
for j in range(tl) :
if st[j] == '?' :
continue
elif st[j] != '?' and st[j] == t[j] :
continue
c = 1
break
if c == 0 :
s = s[:i-tl] + t + s[i:]
break
if c == 1 :... |
s969584650 | p03565 | u454557108 | 1586180670 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 364 | s = input()
t = input()
tl = len(t)
sl = len(s)
for i in range(sl,tl,-1) :
st = s[i-tl:i]
c = 0
for j in range(tl) :
if st[j] == '?' :
continue
elif st[j] != '?' and st[j] == t[j] :
continue
c = 1
break
if c == 0 :
s = s[:i-tl] + t + s[i:]
break
if c == 1 :
print('UNRESTO... |
s983672188 | p03565 | u089376182 | 1586129478 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3188 | 309 | import re
s = input().replace('?', '.')
t = input()
for i in range(len(s)-len(t)+1):
check_str = s[len(s)-len(t)-i:len(s)-i]
if re.match(check_str, t):
break
if i==len(s)-len(t):
print('UNRESTORABLE')
else:
ans = s[:len(s)-len(t)-i] + t + s[len(s)-i:]
ans = ans.replace('.', 'a')
print(ans) |
s627023774 | p03565 | u255673886 | 1586020482 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38384 | 1114 | # import sys
# readline = sys.stdin.buffer.readline
# from collections import deque
# from copy import copy,deepcopy
# from itertools import permutations,combinations
# from pprint import pprint
# def myinput():
# return map(int,input().split())
# def mycol(data,col):
# return [ row[col] for row in data ]
#... |
s738289118 | p03565 | u255673886 | 1586020358 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38384 | 1116 | # import sys
# readline = sys.stdin.buffer.readline
# from collections import deque
# from copy import copy,deepcopy
# from itertools import permutations,combinations
# from pprint import pprint
# def myinput():
# return map(int,input().split())
# def mycol(data,col):
# return [ row[col] for row in data ]
#... |
s834649409 | p03565 | u255673886 | 1586020193 | Python | PyPy3 (2.4.0) | py | Runtime Error | 188 | 38256 | 1113 | # import sys
# readline = sys.stdin.buffer.readline
# from collections import deque
# from copy import copy,deepcopy
# from itertools import permutations,combinations
# from pprint import pprint
# def myinput():
# return map(int,input().split())
# def mycol(data,col):
# return [ row[col] for row in data ]
#... |
s085295148 | p03565 | u255673886 | 1586020119 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38256 | 1094 | # import sys
# readline = sys.stdin.buffer.readline
# from collections import deque
# from copy import copy,deepcopy
# from itertools import permutations,combinations
# from pprint import pprint
# def myinput():
# return map(int,input().split())
# def mycol(data,col):
# return [ row[col] for row in data ]
#... |
s391069128 | p03565 | u255673886 | 1586020089 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38256 | 1110 | # import sys
# readline = sys.stdin.buffer.readline
# from collections import deque
# from copy import copy,deepcopy
# from itertools import permutations,combinations
# from pprint import pprint
# def myinput():
# return map(int,input().split())
# def mycol(data,col):
# return [ row[col] for row in data ]
#... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.