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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s249577451 | p03565 | u466331465 | 1554789513 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3572 | 1158 | import copy
S=list(input())
S1 = "".join(S)
T=list(input())
T1 = "".join(T)
F = ["?"]*len(T)
F1 = "".join(F)
l =[]
M =[]
index =[]
B = copy.deepcopy(S)
while -1<S1.find(F1):
a = S1.find(F1)
index.append(a)
B[a] ="a"
S1="".join(B)
S1 ="".join(S)
for i in range(len(S)-len(T)+1):
if S[i]==T[0]:
... |
s666705450 | p03565 | u466331465 | 1554788454 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3572 | 1208 | import copy
S=list(input())
S1 = "".join(S)
T=list(input())
T1 = "".join(T)
F = ["?"]*len(T)
F1 = "".join(F)
l =[]
M =[]
index =[]
B = copy.deepcopy(S)
while -1<S1.find(F1):
a = S1.find(F1)
index.append(a)
B[a] ="a"
S1="".join(B)
S1 ="".join(S)
for i in range(len(S)-len(T)+1):
if S[i]==T[0]:
... |
s362611553 | p03565 | u083960235 | 1554780360 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 633 | S=input()
T=input()
flag=False
for i in range(len(S)-len(T)+1):
dif=0
same=0
s=S[i:i+len(T)]#len(T)
for j in range(len(T)):
if s[j]!='?':#sが言葉の時
if s[j]!=T[j]:
#print("st",s[i],T[i])
dif+=1
else:
same+=1
# fla... |
s886245333 | p03565 | u083960235 | 1554780231 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 615 | S=input()
T=input()
flag=False
for i in range(len(S)-len(T)+1):
dif=0
same=0
s=S[i:i+len(T)]#len(T)
for j in range(len(T)):
if s[j]!='?':#sが言葉の時
if s[j]!=T[j]:
#print("st",s[i],T[i])
dif+=1
else:
same+=1
# fla... |
s679026821 | p03565 | u771532493 | 1554661255 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 567 | s=list(input())
t=list(input())
ls=len(s)
lt=len(t)
m=ls-lt
if m<0:
print('UNRESTORABLE')
else:
for i in range(m,-1,-1):
l=s[i:]
for j in range(lt):
if t[j]==l[j] or l[j]=='?':
A=True
else:
A=False
break
if A:
if i==0:
s=t+s[lt:]
s=s.translate(st... |
s446775565 | p03565 | u771532493 | 1554660479 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 436 | s=list(input())
t=list(input())
ls=len(s)
lt=len(t)
m=ls-lt
if m<0:
print('UNRESTORABLE')
else:
for i in range(m,-1,-1):
l=s[i:]
for j in range(lt):
if t[j]==l[j] or l[j]=='?':
A=True
else:
A=False
break
if A:
s=s[:i]+t
s=''.join(s)
s=s.translate(str... |
s824017383 | p03565 | u623819879 | 1554429933 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 527 | # coding: utf-8
# Your code here!
s=input()
t=input()
if len(s)-len(t)<0:
flg=False
else:
for i in range(len(s)-len(t)):
ans=s
for j in range(len(t)):
flg=True
if t[-1-j]==s[-1-j-i] or s[-1-j-i]=='?':
#print(ans)
ans=ans[:-1-j-i]+t[-1-j]+(... |
s474882510 | p03565 | u623819879 | 1554429791 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 440 | # coding: utf-8
# Your code here!
s=input()
t=input()
for i in range(len(s)-len(t)):
ans=s
for j in range(len(t)):
flg=True
if t[-1-j]==s[-1-j-i] or s[-1-j-i]=='?':
#print(ans)
ans=ans[:-1-j-i]+t[-1-j]+('' if -1-i-j+1==0 else ans[-1-i-j+1:])
else:
fl... |
s962997580 | p03565 | u092926023 | 1554409524 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 816 | s = input()
t = input()
ls=len(s)
lt=len(t)
if ls < lt:
print(errorword)
else:
for i in range(ls-lt,-1,-1):
is_matched = True
s_slice = slice(i, lt+2)
for s_char, t_char in zip(s[s_slice], t):
# 文字が不一致かつ？以外の場合は文字列不一致のためbreak
if (s_char != t_char) and s_char != '... |
s942079776 | p03565 | u620945921 | 1554345533 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 711 | s=input()
t=input()
#print(s,t)
if len(s) < len(t):
print('UNRESTORABLE')
elif len(s) == len(t):
cnt=0
for i in range(len(s)):
if s[i] == t[i]:
cnt+=1
elif s[i] == '?':
cnt+=1
if len(t)==cnt:
print(t)
else:
print('UNRESTORABLE')
else:
flag1=0
for j in range(len(s)):
cn... |
s321683496 | p03565 | u620945921 | 1554341614 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 326 | #import re
s=input()
t=input()
#print(s,t)
flag1=0
for j in range(len(s)-len(t)+1):
flag=0
for i in range(len(t)):
if s[i+j]=='?' or s[i+j]==t[i]:
flag+=1
if flag==len(t):
flag1=1
s=s[0:j]+t[j-2:j+len(t)-2]+s[j+len(t):]
s=s.replace('?','a')
print(s)
if flag1==0:
print('UNRESTORA... |
s704176713 | p03565 | u620945921 | 1554341322 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 324 | #import re
s=input()
t=input()
#print(s,t)
flag1=0
for j in range(len(s)-len(t)+1):
flag=0
for i in range(len(t)):
if s[i+j]=='?' or s[i+j]==t[i]:
flag+=1
if flag==len(t):
flag1=1
s=s[0:j]+t[j-1:j+len(t)]+s[j+len(t):]
s=s.replace('?','a')
print(s)
if flag1==0:
print('UNRESTORABL... |
s224759988 | p03565 | u171366497 | 1554223933 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 523 | S=input()
T=input()
def check(i):
flag=True
for j in range(len(T)):
if S[i+j]!='?' and S[i+j]!=T[j]:
flag=False
break
return flag
def search(S,T):
for i in range(len(S)-len(T),-1,-1):
if check(i):return i
return -1
def main(S,T):
ans=''
if T not in S:
... |
s456638282 | p03565 | u502389123 | 1554171499 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 574 | S = input()
T = input()
change_index = []
for i in range(len(S)-len(T)+1):
step = 0
for j in T:
# if i + step >= len(S):
# break
if S[i+step] != j and S[i+step] != '?':
break
step += 1
if step == len(T):
change_index.append(i)
if len(change_ind... |
s665595771 | p03565 | u013408661 | 1554170871 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 444 | s=input()
t=input()
ans=[]
for i in range(len(s)):
s.insert(0,s.pop())
s=''.join(s)
m=[]
flag=True
for j in range(len(t)):
if s[j]=='?' or t[j]==s[j]:
m.append(t[j])
else:
flag=False
break
if flag:
for j in range(len(t),len(s)):
if s[j]=='?':
m.append(a)
els... |
s987590646 | p03565 | u013408661 | 1554170779 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 397 | s=input()
t=input()
ans=[]
for i in range(len(s)):
s.insert(0,s.pop())
s=''.join(s)
m=[]
flag=True
for j in range(len(t)):
if s[j]=='?' or t[j]==s[j]:
m.append(t[j])
else:
flag=False
break
if flag:
for j in range(len(t),len(s)):
if s[j]=='?':
m.append(a)
els... |
s461133284 | p03565 | u565204025 | 1554163905 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 499 | # -*- coding: utf-8 -*-
s = list(input())
t = list(input())
a = []
for i in range(len(t)-1,len(s)):
lock = True
for j in range(len(t)):
if s[i-len(t)+j+1] == "?":
pass
elif s[i-len(t)+j+1] != t[j]:
lock = False
if lock:
a.append(s[:i-len(t)+1] + t[:])
if le... |
s526694558 | p03565 | u159994501 | 1554155604 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 445 | S = list(input())
T = list(input())
LS = len(S)
LT = len(T)
a = ""
for i in range(LS - LT + 1):
for j in range(LT):
if S[i + j] != T[j] and S[i + j] != "?":
break
if j == LT - 1:
for k in range(LT):
S[i + k] = T[k]
#print("".join(S))
s ... |
s243794844 | p03565 | u371763408 | 1553615221 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 272 | s=input()
t=input()
for i in range(len(s)-len(t)+1):
flag=True
for j in range(len(t)):
if s[i+j]==t[j] and s[i+j]=="?":
continue
else:
flag=False
if flag:
s=s[:i]+t+s[i+len(t):]
s=s.replace("?","a")
print(s if flag else "UNRESTORABLE")
|
s089546555 | p03565 | u045354461 | 1553287896 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3444 | 799 | import copy
def solve():
S = list(input())
T = list(input())
tests = []
for i in range(len(S)):
if (is_ok(S, T, i)):
temp = copy.copy(S)
for j in range(len(T)):
temp[i + j] = T[j]
tests.append(afill(temp))
if (len(tests) == 0):
... |
s601048288 | p03565 | u045354461 | 1553287279 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 776 | def solve():
S = list(input())
T = list(input())
tests = []
for i in range(len(S)):
if (is_ok(S, T, i)):
temp = S
for j in range(len(T)):
temp[i + j] = T[j]
tests.append(afill(temp))
if (len(tests) == 0):
print('UNRESTORABLE\n'... |
s023466615 | p03565 | u045354461 | 1553287170 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 776 | def solve():
S = list(input())
T = list(input())
tests = []
for i in range(len(S)):
if (is_ok(S, T, i)):
temp = S
for j in range(len(T)):
temp[i + j] = T[j]
tests.append(afill(temp))
if (len(tests) == 0):
print('UNRESTORABLE\n'... |
s627124150 | p03565 | u399261731 | 1552925027 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 365 | import re
S_ = input()
T = input()
t_len = len(T)-1 if len(T)>1 else 0
if t_len!=0 and len(S_) != 1:
tt = re.findall(".\?{%d}"%t_len, S_)[0]
if tt[0] == T[0] and re.search("\?{%d}"%t_len, S_):
text=re.sub("\?{%d}"%t_len,T[1:],S_)
print(text.replace("?","a"))
else:
print("U... |
s460455717 | p03565 | u399261731 | 1552923244 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 258 | import re
S_ = input()
T = input()
t = T[1:]
ss = re.findall(".\?{%d}"%len(t), S_)[0]
if T[0] == ss[0] and re.search("\?{%d}"%len(t), S_):
text=re.sub("\?{%d}"%len(t),t,S_)
text = re.sub("\?","a",text)
print(text)
else:
print("UNRESTORABLE") |
s324906597 | p03565 | u393512980 | 1552880779 | Python | PyPy3 (2.4.0) | py | Runtime Error | 162 | 38256 | 593 | S = input()
T = input()
flag = False
for i in range(len(S) - len(T) + 1):
k = i
for j in range(len(T)):
if S[k] == T[j] or S[k] == '?':
k += 1
else:
break
if k == i + len(T):
flag = True
st = i
break
ret = ""
print(st)
if flag:
for i in ran... |
s732313672 | p03565 | u585482323 | 1552878527 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 38640 | 1722 | #!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
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.... |
s653189680 | p03565 | u807772568 | 1552418052 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 353 | s = list(input())
t = list(input())
l = []
for i in range(len(s)-len(t) + 1):
f = True
for j in range(len(t)):
if s[i+j] != '?' and s[i+j] != t[j]:
f = False
break
if f:
a = s[:i] + t + s[i+len(t):]
l.append(a.replace('?','a'))
if len(l)>0:
print(min(l))... |
s725282851 | p03565 | u807772568 | 1552417956 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 353 | s = list(input())
t = list(input())
l = []
for i in range(len(s)-len(t) - 1):
f = True
for j in range(len(t)):
if s[i+j] != '?' and s[i+j] != t[j]:
f = False
break
if f:
a = s[:i] + t + s[i+len(t):]
l.append(a.replace('?','a'))
if len(l)>0:
print(min(l))... |
s700503770 | p03565 | u807772568 | 1552417890 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 353 | s = list(input())
t = list(input())
l = []
for i in range(len(s)-len(t) - 1):
f = True
for j in range(len(t)):
if s[i+j] != '?' and s[i+j] != t[j]:
f = False
break
if f:
a = s[i:] + t + s[:i+len(t)]
l.append(a.replace('?','a'))
if len(l)>0:
print(min(l))... |
s794350008 | p03565 | u807772568 | 1552417587 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 353 | s = list(input())
t = list(input())
l = []
for i in range(len(s)-len(t) - 1):
f = True
for j in range(len(t)):
if s[i+j] != '?' and s[i+j] != t[j]:
f = False
break
if f:
a = s[:i] + t + s[:i+len(t)]
l.append(a.replace('?','a'))
if len(l)>0:
print(min(l))... |
s496361681 | p03565 | u825528847 | 1552259581 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 267 | S = input()
T = input()
for i in range(len(S)):
for j in range(len(T)):
if S[i+j] != "?" and S[i+j] != T[j]:
break
else:
S = S[:i] + T
S = S.replace('?', 'a')
print(S)
break
else:
print("UNRESTORABLE")
|
s512003580 | p03565 | u350997995 | 1551873772 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 435 | S = list(input())
T = input()
for c in range(len(S),len(T)-1,-1):
for i in range(len(T)):
if S[c-len(T)+i]!='?' and S[c-len(T)+i]!=T[i]:
i = 0
break
if i>0:
for j in range(len(T)):
S[c-len(T)+j]=T[j]
break
if i>0:
for j in S:
if j=='?':
... |
s284660519 | p03565 | u977389981 | 1551490346 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 278 | S = input()
T = input()
n = len(S)
m = len(T)
ans = 'UNRESTORABLE'
for i in range(n - m + 1):
for j in range(m):
if S[i + j] != '?' and S[i + j] != T[j]:
break
else:
S2 = S[: i] + T + S[i + m :]
ans = S2.replace('?', 'a')
print(ans) |
s004410402 | p03565 | u411858517 | 1551483151 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1068 | S = input()
T = input()
for i in range(len(S) - len(T) + 1):
flag = True
for j in range(len(T)):
if S[i+j] != T[j]:
flag = False
if flag:
break
if flag:
res = ''
for i in range(len(S)):
if S[i] == '?':
res += 'a'
else:
... |
s867601667 | p03565 | u411858517 | 1551483008 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1024 | S = input()
T = input()
for i in range(len(S) - len(T) + 1):
flag = True
for j in range(len(T)):
if S[i+j] != T[j]:
flag = False
if flag:
break
if flag:
res = ''
for i in range(len(S)):
if S[i] == '?':
res += 'a'
else:
... |
s933558466 | p03565 | u411858517 | 1551482664 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1029 | S = input()
T = input()
for i in range(len(S) - len(T) + 1):
flag = True
for j in range(len(T)):
if S[i+j] != T[j]:
flag = False
if flag:
break
if flag:
res = ''
for i in range(len(S)):
if S[i] == '?':
res += 'a'
else:
... |
s691466924 | p03565 | u411858517 | 1551476864 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1028 | S = input()
T = input()
for i in range(len(S) - len(T) + 1):
flag = True
for j in range(len(T)):
if S[i+j] != T[j]:
flag = False
if flag:
break
if flag:
res = ''
for i in range(len(S)):
if S[i] == '?':
res += 'a'
else:
... |
s233798870 | p03565 | u411858517 | 1551475665 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 953 | S = input()
t = input()
tmp1 = 0
tmp2 = 0
res = ''
flag = False
for i in range(len(S) - len(t)+1):
h = True
for j in range(len(t)):
if S[i+j] != t[j]:
h = False
if h == True:
flag = True
break
if h != True:
while True:
if S[-tmp1 - 1] ==... |
s648765034 | p03565 | u411858517 | 1551475516 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 953 | S = input()
t = input()
tmp1 = 0
tmp2 = 0
res = ''
flag = False
for i in range(len(S) - len(t)+1):
h = True
for j in range(len(t)):
if S[i+j] != t[j]:
h = False
if h == True:
flag = True
break
if h != True:
while True:
if S[-tmp1 - 1] ==... |
s471682568 | p03565 | u411858517 | 1551473038 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 923 | S = input()
t = input()
tmp1 = 0
tmp2 = 0
res = ''
flag = False
for i in range(len(S) - len(t)+1):
h = True
for j in range(len(t)):
if S[i+j] != t[j]:
h = False
if h == True:
flag = True
break
if h != True:
while True:
if S[-tmp1 - 1] ==... |
s633450482 | p03565 | u411858517 | 1551472727 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 922 | S = input()
t = input()
tmp1 = 0
tmp2 = 0
res = ''
flag = False
for i in range(len(S) - len(t)+1):
h = True
for j in range(len(t)):
if S[i+j] != t[j]:
h = False
if h == True:
flag = True
break
if h != True:
while True:
if S[-tmp1 - 1] ==... |
s059754886 | p03565 | u411858517 | 1551472525 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 920 | S = input()
t = input()
tmp1 = 0
tmp2 = 0
res = ''
flag = False
for i in range(len(S) - len(t)):
h = True
for j in range(len(t)):
if S[i+j] != t[j]:
h = False
if h == True:
flag = True
break
if h != True:
while True:
if S[-tmp1 - 1] == t... |
s378105454 | p03565 | u411858517 | 1551472355 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 918 | S = input()
t = input()
tmp1 = 0
tmp2 = 0
res = ''
flag = False
for i in range(len(S) - len(t)):
h = True
for j in range(len(t)):
if S[i] != t[j]:
h = False
if h == True:
flag = True
break
if h != True:
while True:
if S[-tmp1 - 1] == t[-... |
s907438362 | p03565 | u934740772 | 1551067356 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 453 | S=input()
T=input()
s=0
flag1=False
for i in range(len(S)-len(T)+1):
flag2=True
for j in range(len(T)):
if S[i+j]!=T[j] and S[i+j]!='?':
flag2=False
if flag2==True:
flag1=True
s=i
if flag1==False:
print('UNRESTORABLE')
else:
for i in range(len(S)):
if i>=s... |
s983304557 | p03565 | u191829404 | 1550990505 | Python | Python (3.4.3) | py | Runtime Error | 311 | 20248 | 1051 | # https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = map(int,input().split()) | x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = list(map(int... |
s722187417 | p03565 | u191829404 | 1550990327 | Python | Python (3.4.3) | py | Runtime Error | 317 | 21132 | 1058 | # https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = map(int,input().split()) | x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = list(map(int... |
s446456052 | p03565 | u191829404 | 1550990078 | Python | Python (3.4.3) | py | Runtime Error | 151 | 12108 | 1051 | # https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = map(int,input().split()) | x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = list(map(int... |
s436907277 | p03565 | u223133214 | 1550802723 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 454 | S,T=input(),input()
s_list,t_list=list(reversed(list(S))),list(reversed(list(T)))
i=0
num=0
count=0
str=''
for i,s in enumerate(s_list):
if num==len(T):
end,start=i-1,i-len(T)
break
if s=='?' or s==t_list[num]:
num+=1
str+=s
else:
num,str=0,''
if i==len(s_list)-1 ... |
s337856590 | p03565 | u223133214 | 1550800678 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 471 | S,T=input(),input()
s_list,t_list=list(reversed(list(S))),list(reversed(list(T)))
i=0
num=0
count=0
str=''
for i,s in enumerate(s_list):
if num==len(T):
end,start=i-1,i-len(T)
break
if s=='?' or s==t_list[num]:
num+=1
str+=s
elif len(str)!=len(T):
num,str=0,''
if ... |
s157879181 | p03565 | u634461820 | 1550657508 | Python | Python (3.4.3) | py | Runtime Error | 153 | 12260 | 546 | import bisect
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
s = S()
t = S()
for i in range(len(s)-len(t),-1,-1):
cnt = 0
for j in range(i,i+len(t)-1):
if s[... |
s838491720 | p03565 | u634461820 | 1550657360 | Python | Python (3.4.3) | py | Runtime Error | 151 | 12400 | 478 | import bisect
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
s = S()
t = S()
for i in range(len(s)-len(t),-1,-1):
cnt = 0
for j in range(i,i+len(t)-1):
if s[... |
s550043371 | p03565 | u887207211 | 1549917404 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 250 | S = input()
T = input()
len_S = len(S)
len_T = len(T)
for i in range(len_S-len_T, -1, -1):
if not all(s in ['?', t] for s, t in zip(S[i:i+len_T], T)):
continue
print((S[:i] + t + S[i+len_T:]).replace('?','a'))
exit()
print("UNRESTORABLE")
|
s314286608 | p03565 | u533885955 | 1549718719 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1089 | S = str(input())
T = str(input())
slist = list(S)
tlist = list(T)
Slen = len(slist)
Tlen = len(tlist)
ANSlist = []
Flag = 0
if Slen < Tlen:
Flag = 0
else:
for i in range(Slen-Tlen+1):
flag = 0
for j in range(Tlen):
if slist[i+j] == "?" or slist[i+j] == tlist[j]:
pass
... |
s512578918 | p03565 | u533885955 | 1549718586 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3192 | 930 | S = str(input())
T = str(input())
slist = list(S)
tlist = list(T)
Slen = len(slist)
Tlen = len(tlist)
ANSlist = []
Flag = 0
for i in range(Slen-Tlen+1):
flag = 0
for j in range(Tlen):
if slist[i+j] == "?" or slist[i+j] == tlist[j]:
pass
else:
flag = 1
break
... |
s864028506 | p03565 | u303059352 | 1549138233 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 2096 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vp;
typedef map<string, ll> mstrll;
#define pb push_back
#define eb... |
s799857020 | p03565 | u977389981 | 1548605047 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 339 | S = input()
T = input()
ans = 'UNRESTORABLE'
for i in range(len(S) - len(T) + 1):
s = S[i:i+len(T)+1]
flag = 1
for j in range(len(T)):
if s[j] == T[j] or s[j] == '?':
pass
else:
flag = 0
if flag:
ans = S[0:i] + T + S[i+len(T)]
ans = ans.replace('... |
s964500124 | p03565 | u709630872 | 1548130681 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 614 | S_ = list(input())
T = list(input())
for i in range(len(S_)):
for j in range(len(T)):
if S_[i] == T[j]:
i_ = i
j_ = 0
for l in range(i - T.index(T[j]), i - T.index(T[j]) + len(T)):
if S_[l] != T[j_] and S_[l] != '?':
break
e... |
s747006385 | p03565 | u709630872 | 1548122869 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 559 | _ = list(input())
T = list(input())
for i in range(len(S_)):
for j in range(len(T)):
if S_[i] == T[j]:
i_ = i
j_ = j
for k in range(j, len(T)):
if T[k] != S_[i_] and S_[i_] != '?':
break
i_ += 1
else:
... |
s516507806 | p03565 | u656643475 | 1546374934 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 383 | SD = input()
T = input()
ans = ''
for i in range(0, len(SD) - len(T)+1):
flg = True
for j in range(len(T)):
if SD[i+j] == '?' or SD[i+j] == T[j]:
continue
else:
flg = False
if flg == True:
ans = SD[0:i] + T + S[i+len(T):]
if ans:
ans = ans.r... |
s412678787 | p03565 | u656643475 | 1546374828 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 382 | SD = input()
T = input()
ans = ''
for i in range(0, len(SD) - len(T)+1):
flg = True
for j in range(len(T)):
if SD[i+j] == '?' or SD[i+j] == T[j]:
continue
else:
flg = False
if flg == True:
ans = SD[:i] + T + S[i+len(T):]
if ans:
ans = ans.re... |
s782481853 | p03565 | u237362582 | 1546272342 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 643 | S = input()
T = input()
r_S = S[::-1]
r_T = T[::-1]
if T in S:
q_ans = r_S
else:
for i in range(len(r_S)-len(T)+1):
flag = True
for j in range(len(T)):
if r_S[i+j] == '?':
pass
elif r_S[i+j] == r_T[j]:
pass
elif r_S[i+j] != r_T[... |
s995140610 | p03565 | u350248178 | 1544718603 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 490 | s=input()
t=input()
ans=""
k=0
l=0
for i in range(len(s)):
x=i+k
y=0
if x>=len(s):
break
if s[i+k]==t[0]:
for j in range(len(t)):
if (s[x+j]==t[j] or s[x+j]=="?")and x+j<len(s):
y+=1
else:
break
if y==len(t):
ans... |
s137413183 | p03565 | u350248178 | 1544718385 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 486 | s=input()
t=input()
ans=""
k=0
l=0
for i in range(len(s)):
x=i+k
y=0
if x>=len(s):
break
if s[i+k]==t[0]:
for j in range(len(t)):
if (s[x+j]==t[j] or s[x+j]=="?")and x+j<len(s):
y+=1
else:
break
if y==len(t):
ans... |
s950013292 | p03565 | u397531548 | 1544556946 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 637 | S1=input()
T1=input()
S=""
T=""
A=""
for i in range(1,len(S1)+1):
S+=S1[-i]
for i in range(1,len(T1)+1):
T+=T1[-i]
j=0
i=0
flag = False
while i<=len(S)+1-len(T):
while j<=len(T)+1:
if i==len(S)-len(T):
A="UNRESTORABLE"
flag=True
break
elif j==len(T):
... |
s360366735 | p03565 | u397531548 | 1544552491 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 718 | S=input()
T=input()
j=0
i=-1
flag = False
while i>=-1*len(S)-1+len(T):
while j>=-1*len(T)-1:
if i==-1*len(S)-1+len(T):
A="UNRESTORABLE"
flag=True
break
elif j==-1*len(T):
if i!=-1:
P=S.replace(S[i-len(T)+1:i+1],T,1)
A=P.... |
s881612976 | p03565 | u397531548 | 1544551926 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 714 | S=input()
T=input()
j=0
i=-1
flag = False
while i>=-1*len(S)-1+len(T):
while j>=-1*len(T)-1:
if i<=-1*len(S)-1+len(T):
A="UNRESTORABLE"
flag=True
break
elif j==-1*len(T):
if i!=-1:
P=S.replace(S[i-len(T):i+1],T,1)
A=P.re... |
s806190903 | p03565 | u652150585 | 1544070483 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 317 | s=input()
t=input()
l=[]
for i in range(len(s)-len(t)+1):
sl=copy.deepcopy(s)
for j in range(len(t)):
if sl[i+j]!=t[j] and sl[i+j]!='?':
break
else:
s = s[:i] + t + s[i+len(t):]
l.append(s.replace('?', 'a'))
l.sort()
if l:
print(l[0])
else:
print('UNRESTRABLE') |
s095656573 | p03565 | u054106284 | 1543711223 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 612 | Sdash = str(input())
T = str(input())
reslis = []
N = len(Sdash) - len(T) + 1
for i in range(N):
Tdash = Sdash[i:i+len(T)]
for j in range(len(T)):
if Tdash[j] == T[j] or Tdash[j] == "?":
pass
else:
break
else:
if i == 0:
reslis.append(T + Sdash[i+... |
s551733518 | p03565 | u054106284 | 1543711138 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 633 | Sdash = str(input())
T = str(input())
reslis = []
N = len(Sdash) - len(T) + 1
for i in range(N):
Tdash = Sdash[i:i+len(T)]
for j in range(len(T)):
if Tdash[j] == T[j] or Tdash[j] == "?":
pass
else:
break
else:
print(Tdash)
if i == 0:
resli... |
s510032915 | p03565 | u365364616 | 1541580359 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 471 | sp = list(input())
t = list(input())
n = len(sp)
for i in range(len(t), n + 1):
flag = True
for j in range(len(t)):
if sp[n - i + j] != t[j] and sp[n - i + j] != '?':
flag = False
break
if flag:
s = ''
sp[n - i:n - i + len(t)] = t
for j in range(n):
... |
s723028501 | p03565 | u200030766 | 1541518434 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 446 | sd = input()
T = input()
for i in range(len(sd)-len(T),-1,-1):
# print(i)
st=sd[i:len(T)+i]
# print(sd[i:len(T)+i])
fl=True
for j in range(len(T)):
if st[j]!='?':
if st[j]!=T[j]:
fl=False
if fl:
s=sd[:i]+T+sd[len(T)+i:]
for k in range(len(s)):
... |
s581658004 | p03565 | u724892495 | 1539546647 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 310 | S = input()
T = input()
for i in range(len(S)-len(T)+1):
ok = False
for j in range(len(T)):
if S[i+j]!=T[j] and S[i+j]!='?':
break
else:
S = S[:i] + T + S[i+len(T):]
ok = True
break
if ok:
print(S.replace('?', 'a'))
else:
print("UNRESTORABLE")
|
s785247479 | p03565 | u940102677 | 1539467651 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 317 | a = input()
t = input()
n = len(a)
m = len(t)
if n<m:
print(UNRESTORABLE)
exit()
for i in range(n-m+1)[::-1]:
flag = True
for j in range(m):
if a[i+j] != t[j] and a[i+j] != "?":
flag = False
if flag:
b = a.replace("?","a")
print(b[:i] + t + b[i+m:])
exit()
print(UNRESTORABLE) |
s233477391 | p03565 | u099918199 | 1538796199 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 609 | s = str(input())
t = str(input())
ans = "NG"
for i in reversed(range(len(s))):
if ans == "OK":
ind = i+1
break
if s[i] == t[0]:
a = 0
while a < len(t):
if s[i+a] == t[0+a] or s[i+a] == "?":
a += 1
else:
break
else:
... |
s556945526 | p03565 | u513081876 | 1537674838 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 303 | S = input()
T = input()
s = 'T'
for i in range(len(S)-len(T)+1):
for j in range(len(T)):
if S[i+j] != T[j] and S[i+j] != '?':
break
else:
s = S[:i]+T+S[i+len(T):]
s = s.replace('?', 'a')
print(s)
break
if s ='T':
print('UNRESTORABLE') |
s026872438 | p03565 | u411858517 | 1536188838 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 605 |
S = input()
T = input()
res = ''
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
end = i + j
if S[i+j] == T[j]:
flag = 1
elif S[i+j] == '?':
flag = 1
else:
flag = -1
break
if flag == 1:
break... |
s167528791 | p03565 | u411858517 | 1536188101 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 659 | S = input()
T = input()
res = ''
end = -1
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
if S[i+j] == T[j]:
end = i + j
flag = 1
elif S[i+j] == '?':
end = i + j
flag = 0
else:
flag = 0
... |
s417652891 | p03565 | u411858517 | 1536188009 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 641 | S = input()
T = input()
res = ''
end = -1
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
if S[i+j] == T[j]:
end = i + j
flag == 1
elif S[i+j] == '?':
end = i + j
flag == 1
else:
pass
... |
s551756336 | p03565 | u411858517 | 1536187951 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 605 | S = input()
T = input()
res = ''
end = -1
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
if S[i+j] == T[j]:
end = i + j
elif S[i+j] == '?':
end = i + j
else:
pass
break
if flag == 1:
... |
s722142282 | p03565 | u411858517 | 1536187408 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 600 | S = input()
T = input()
res = ''
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
end = i + j
if S[i+j] == T[j]:
flag = 1
elif S[i+j] == '?':
flag = 0
else:
flag = -1
break
if flag == 1:
break
... |
s096276279 | p03565 | u411858517 | 1536187370 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 628 | S = input()
T = input()
res = ''
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
end = i + j
if S[i+j] == T[j]:
flag = 1
elif S[i+j] == '?':
flag = 0
else:
flag = -1
break
if flag == 1:
break
... |
s632080010 | p03565 | u411858517 | 1536187279 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 634 | S = input()
T = input()
res = ''
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
end = i + j
if S[i+j] == T[j]:
flag = 1
elif S[i+j] == '?':
flag = 0
else:
flag = -1
break
if flag == 1:
break
... |
s421948659 | p03565 | u411858517 | 1536186968 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 642 | S = input()
T = input()
res = ''
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
end = i + j
if S[i+j] == T[j]:
flag = 1
elif S[i+j] == '?':
flag = 0
else:
start = 0
end = 0
flag = -1
... |
s096069442 | p03565 | u411858517 | 1536186713 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 661 | S = input()
T = input()
tmp = ''
res = ''
count = 0
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
end = i + j
if S[i+j] == T[j]:
flag = 1
elif S[i+j] == '?':
flag = 0
else:
start = 0
end = 0
... |
s614749394 | p03565 | u411858517 | 1536186571 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 677 | S = input()
T = input()
tmp = ''
res = ''
count = 0
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
end = i + j
if S[i+j] == T[j]:
flag = 1
elif S[i+j] == '?':
flag = 0
else:
start = 0
end = 0
... |
s549157262 | p03565 | u411858517 | 1536185928 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 629 | S = input()
T = input()
tmp = ''
res = ''
count = 0
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
start = i
end = i + j
if S[i+j] == T[j]:
tmp += T[j]
elif S[i+j] == '?':
tmp += '?'
else:
start = 0
end = 0
... |
s744631344 | p03565 | u427344224 | 1536118313 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 551 | S = input()
T = input()
tmp = ''
start = 0
result_list = []
for i, s in enumerate(S):
if s == '?':
start = i
tmp += s
elif s == T[len(tmp)]:
start = i
tmp += s
else:
tmp = ''
if len(tmp) == len(T):
while start + 1 <= len(S) and S[start + 1] == '?':
... |
s460101170 | p03565 | u427344224 | 1536101931 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 601 | S = input()
T = input()
result = []
t_length = len(T)
tmp = ''
result = ''
start = 0
result_list = []
for i, s in enumerate(S):
if s == '?':
start =i
tmp += s
result += s
elif s == T[len(tmp)]:
start = i
tmp += s
else:
tmp = ''
result += s
if len... |
s941355951 | p03565 | u439396449 | 1531968474 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 966 | S2 = input()
T = input()
N = len(S2)
index = -1
q_num = 0
q_index = -1
tmp = 0
for i in range(N):
if S2[i] == '?':
tmp += 1
q_num = max(q_num, tmp)
if len(T) <= q_num:
q_index = i - q_num + 1
else:
tmp = 0
if S2[i] == T[0] and i + len(T) <= N:
index = i
... |
s969195831 | p03565 | u439396449 | 1531966881 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 562 | S2 = input()
T = input()
index = S2.find(T[0])
if index == -1:
S = list('UNRESTORABLE')
elif len(S2) - index < len(T):
S = list('UNRESTORABLE')
else:
S = [None] * len(S2)
for i in range(len(S)):
if i > index:
if S2[i] == T[i - index]:
S[i] = S2[i]
elif S2... |
s822302788 | p03565 | u856232850 | 1530420041 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 270 | s = input()
t = input()
a =[]
for i in range(len(s)-len(t)+1):
f = True
for j in range(len(t)):
if s[i+j] != '?' and s[i+j] != t[j]:
f = False
if f == True:
a.append(i)
s = s.replace('?','a')
print(s[:a[-1]]+t+s[a[-1]+len(t):])
|
s575497113 | p03565 | u506302470 | 1529889131 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 660 | #include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin>>a>>b;
for(int i=a.size()-1;i>=b.size()-1;i--){
int fail=0;
for(int j=b.size()-1;j>=0;j--){
if(a[i+j-b.size()+1]=='?'||a[i+j-b.size()+1]==b[j]){
}
else{
fail=1;
... |
s424726563 | p03565 | u839857256 | 1529529276 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 511 | s = input()
t = input()
ans = ''
for i in range(len(s)-len(t), -1, -1):
s_tmp = s[i:i+len(t)]
flag = 0
for j in range(len(t)):
if s_tmp[j] == '?':
s_tmp = t[:j+1] + s_tmp[j+1:]
elif s_tmp[j] != t[j]:
flag = 1
break
if flag == 0:
ans = s[:i] + t... |
s654471837 | p03565 | u944209426 | 1529373690 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 381 | s=input()
t=input()
if len(s)<len(t):
print("UNRESTORABLE")
else:
x=[]
for i in range(len(s)-len(t)+1):
k=0
for j in range(len(t)):
if s[i+j]!=t[j] and s[i+j]!="?":
k+=1
if k==0:
x.append((s[:i]+t+s[(i+len(t)):]).replace("?","a"))
if len(x)==0:... |
s898048681 | p03565 | u270681687 | 1527020002 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 576 | s = input()
t = input()
ans = "UNRESTORABLE"
memo = -1
for i in range(len(s)):
for j in range(len(t)):
count = 0
if s[i+j] == t[j] or t[j] == "?":
count += 1
else:
count = 0
break
if count == len(t):
ans = s[i:i+len(t)]
m... |
s636893050 | p03565 | u881612683 | 1526420967 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 282 | S_ = input()
T = input()
a = S_
b = T
def fit(pat, word):
return all([pi==wi for pi, wi in zip(pat, word) if pi != '?'])
for i in reversed(range(len(a)-len(b)+1)):
if fit(a[i:i+len(b)], b):
ret = a[:i]+b+a[i+len(b):]
break
print(ret.replace('?', 'a'))
|
s293538793 | p03565 | u881612683 | 1526420590 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 255 | S_ = input()
T = input()
a = S_
b = T
def fit(pat, word):
and([pi==wi for pi, wi in zip(pat, w) if s != '?'])
for i in reversed(range(len(a)-len(b)+1)):
if fit(a[i:i+len(b)], b):
ret = a[:i]+b+a[i+len(b):]
print(ret.replace('?', 'a')
|
s485031096 | p03565 | u062147869 | 1525929822 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 350 |
S = str(input())
T = str(input())
a = len(S)
b = len(T)
if (a < b):
print("UNRESTORABLE")
exit()
m = a-b
B = "UNRESTORABLE"
for i in range(m+1):
for j in range(b):
if S[i+j] == T[j]:
S =S.replace(S[i:i+b+1], T)
S = S.replace('?', 'a')
B = S
break
... |
s373434479 | p03565 | u102126195 | 1525568236 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 656 | s = input()
t = input()
S = []
T = []
S_a = []
for i in range(len(s)):
S.append(s[i])
for i in range(len(t)):
T.append(t[i])
for i in range(len(S)):
if S[i] == T[0]:
for j in range(len(T)):
if S[i + j] != T[j] and S[i + j] != "?":
print('a')
print(S[i... |
s088388881 | p03565 | u354638986 | 1524849537 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 581 | s_d = [i for i in input()]
t = input()
flg = True
for i in range(len(s_d)-1, -1, -1):
if len(s_d) - i >= len(t) and s_d[i] == '?' or s_d[i] == t[0]:
j, n = i+1, 1
while j <= len(s_d) - 1:
if s_d[j] == '?' or s_d[j] == t[n]:
j += 1
n += 1
else:... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.