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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s001546343 | p03565 | u251515715 | 1568664834 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 279 | s=input()
t=input()
f=0
e=5
flg=0
while e<=len(s):
tmp=s[f:e]
for i in range(len(t)):
if tmp[i]!=t[i] and tmp[i]!='?':
break
if i==len(t)-1:
ans=s[:f]+t+s[e:]
flg=1
f+=1
e+=1
if flg==0:
print('UNRESTORABLE')
else:
print(ans.replace('?','a')) |
s520615110 | p03565 | u251515715 | 1568664446 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 273 | s=input()
t=input()
f=0
e=5
flg=0
while e<=len(s):
tmp=s[f:e]
for i in range(len(t)):
if tmp[i]!=t[i] and tmp[i]!='?':
break
if i==len(t)-1:
s=s[:f]+t+s[e:]
flg=1
print(s.replace('?','a'))
f+=1
e+=1
if flg==0:
print('UNRESTORABLE') |
s115695144 | p03565 | u028973125 | 1568609196 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 38256 | 748 | import sys
from pprint import pprint
s = sys.stdin.readline().strip()
t = sys.stdin.readline().strip()
len_s = len(s)
len_t = len(t)
# print(len_s, len_t)
for i in range(0, len_s - len_t + 1):
flag = True
for j in range(len_t):
if flag == False:
continue
# print(s[i+j], t[j])
... |
s356329737 | p03565 | u598229387 | 1568576705 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 539 | s=input()
t=input()
li=[]
for i in range(len(s)-len(t)+1):
if s[i]==t[0] or s[i]=='?':
check=1
tid=1
while True:
if s[i+1] ==t[tid] or s[i+1]=='?':
check+=1
i+=1
tid+=1
if check==len(t):
li.app... |
s062170529 | p03565 | u598229387 | 1568576599 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 539 | s=input()
t=input()
li=[]
for i in range(len(s)-len(t)+1):
if s[i]==t[0] or s[i]=='?':
check=1
tid=1
while True:
if s[i+1] ==t[tid] or s[i+1]=='?':
check+=1
i+=1
tid+=1
if check==len(t):
li.app... |
s533967780 | p03565 | u598229387 | 1568576536 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 549 |
s=input()
t=input()
li=[]
for i in range(len(s)-len(t)+1):
if s[i]==t[0] or s[i]=='?':
check=1
tid=1
while True:
if s[i+1] ==t[tid] or s[i+1]=='?':
check+=1
i+=1
tid+=1
if check==len(t):
li.ap... |
s132926343 | p03565 | u598229387 | 1568576195 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 546 | s=input()
t=input()
li=[]
for i in range(len(s)-len(t)+1):
if s[i]==t[0] or s[i]=='?':
check=1
tid=1
while True:
if s[i+1] ==t[tid] or s[i+1]=='?':
check+=1
i+=1
tid+=1
if check==len(t):
li.app... |
s254771793 | p03565 | u598229387 | 1568576154 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 574 | s=input()
t=input()
li=[]
for i in range(len(s)-len(t)+1):
if s[i]==t[0] or s[i]=='?':
check=1
tid=1
while True:
if s[i+1] ==t[tid] or s[i+1]=='?':
check+=1
i+=1
tid+=1
print(check)
if check==len(t)... |
s418025652 | p03565 | u814986259 | 1568090486 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 998 | S_ = input()
T = input()
ans = list(S_)
for i in range(len(T)):
if T[i] in S_:
prev = len(S_)
while(1):
id = S_.rfind(T[i], 0, prev-1)
if id < 0:
break
prev = id
flag = True
for j in range(i+1, len(T)):
if S_... |
s779190496 | p03565 | u814986259 | 1568090390 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 989 | S_ = input()
T = input()
ans = list(S_)
for i in range(len(T)):
if T[i] in S_:
prev = len(S_)
while(1):
id = S_.rfind(T[i], 0, prev-1)
if id < 0:
break
prev = id
flag = True
for j in range(i+1, len(T)):
if S_[id + j -... |
s602380431 | p03565 | u814986259 | 1568090307 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 977 | S_ = input()
T = input()
ans = list(S_)
for i in range(len(T)):
if T[i] in S_:
prev = len(S_)
while(1):
id = S_.rfind(T[i], 0, prev-1)
if id < 0:
break
flag = True
for j in range(i+1, len(T)):
if S_[id + j - i] == T[i] ... |
s035268141 | p03565 | u814986259 | 1568089768 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 835 | S_ = input()
T = input()
ans = list(S_)
for i in range(len(T)):
if T[i] in S_:
id = S_.rfind(T[i])
if id < 0:
continue
flag = True
for j in range(i+1, len(T)):
if S_[id + j - i] == T[i] or S_[id + j - i] == "?":
continue
else:
... |
s717440428 | p03565 | u814986259 | 1568089439 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 795 | S_ = input()
T = input()
ans = list(S_)
for i in range(len(T)):
if T[i] in S_:
id = S_.rfind(T[i])
flag = True
for j in range(i+1, len(T)):
if S_[id + j - i] == T[i] or S_[id + j - i] == "?":
continue
else:
flag = False
... |
s334787686 | p03565 | u726769307 | 1567882442 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38384 | 457 | import copy
S = list(input())
T = list(input())
for i in range(len(S) - len(T) + 1):
c = 0
A=copy.copy(S)
check = False
for j in range(len(T)):
if A[i + j] == T[j]:
c += 1
elif A[i + j] == "?":
A[i + j] = T[j]
c += 1
else:
break
... |
s396060249 | p03565 | u609738635 | 1567873201 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 696 | def main(S_,T):
for i in range(len(S_)-len(T)+1):
cnt = 0
idx = -1
for j in range(len(T)):
if(S_[i+j]==T[j] or S_[i+j]=="?"):
cnt += 1
if cnt == len(T):
idx = i+j-len(T)+1
else:
continue
... |
s179353809 | p03565 | u207539104 | 1567629378 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 629 | #入力
S_prime = str(input())
T = str(input())
ans = []
if len(S_prime) >= len(T):
times = len(S_prime) - len(T) + 1
for i in range(times):
count = 0
for j in range(len(T)):
if S_prime[i+j] == '?':
count = count + 1
elif S_prime[i+j] != T[j]:
... |
s426053811 | p03565 | u214434454 | 1567459139 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 534 | s_d = input()
t = input()
s = "a"
for i in range(len(s_d) - len(t), -1, -1):
possible = True
for j in range(len(t)):
if s_d[i + j] == t[j] or s_d[i + j] == "?":
continue
else:
possible = False
break
if possible == False:
continue
else:
... |
s700628632 | p03565 | u214434454 | 1567458363 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 522 | s_d = input()
t = input()
possible = True
for i in range(len(s_d) - len(t), -1, -1):
for j in range(len(t)):
if s_d[i + j] == t[j] or s_d[i + j] == "?":
continue
else:
possible = False
break
if possible == False:
continue
else:
s = s_d[:i] ... |
s870105135 | p03565 | u214434454 | 1567458264 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 526 | s_d = input()
t = input()
for i in range(len(s_d) - len(t), -1, -1):
possible = True
for j in range(len(t)):
if s_d[i + j] == t[j] or s_d[i + j] == "?":
continue
else:
possible = False
break
if possible == False:
continue
else:
s = s_d[... |
s694898690 | p03565 | u540799318 | 1567117839 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 663 | ss = input()
t = insput()
def search(ss,t):
ans = []
if len(ss) < len(t):
return ans
for i in range(len(ss) - len(t), -1, -1):
ss_cut = ss[i:len(t)+i]
flag = True
for j in range(len(t)):
if ss_cut[j] != '?' and ss_cut[j] != t[j]:
flag = False
... |
s410213801 | p03565 | u852517668 | 1566447574 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 305 | S = input()
T = input()
for i in range(len(S) - len(T), -1, -1):
flag = True
for j in range(len(T)):
if S[i+j] != '?' and S[i+j] != T[j]:
flag = False
break
if flag:
break
if flag:
U = S[:i] + T + S[i+len(T):]
U = U.replace('?', 'a')
print(U)
else:
print('UNRESTORABLE') |
s059729080 | p03565 | u852517668 | 1566447453 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38256 | 305 | S = input()
T = input()
for i in range(len(S) - len(T), -1, -1):
flag = True
for j in range(len(T)):
if S[i+j] != '?' and S[i+j] != T[j]:
flag = False
break
if flag:
break
if flag:
U = S[:i] + T + S[i+len(T):]
U = U.replace('?', 'a')
print(U)
else:
print('UNRESTORABLE') |
s028347309 | p03565 | u548684908 | 1566402403 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 572 | S = input()
T = input()
N = len(S)
M = len(T)
i_a = 0
for i in reversed(range(N-M+1)):
ans = 0
for j in range(M):
if T[j] == S[i+j] or S[i+j] == '?':
ans += 1
else:
break
if ans == M:
for k in range(N):
if k == i:
print(T,end='')
... |
s497337064 | p03565 | u548684908 | 1566402363 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 575 | S = input()
T = input()
N = len(S)
M = len(T)
i_a = 0
for i in reversed(range(N-M+1)):
ans = 0
for j in range(M):
if T[j] == S[i+j] or S[i+j] == '?':
ans += 1
else:
break
if ans == M:
for k in range(N):
if k == i:
print(T,end='')
... |
s062320086 | p03565 | u548684908 | 1566361540 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 549 | S = input()
T = input()
N = len(S)
M = len(T)
i_a = 0
for i in reversed(range(N-M+1)):
ans = 0
for j in range(M):
if T[j] == S[i+j] or S[i+j] == '?':
ans += 1
else:
break
if ans == M:
for k in range(N):
if k == i:
print(T,end='')
... |
s903929941 | p03565 | u102126195 | 1566050589 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38384 | 542 | s = input()
t = input()
cnt = 0
for i in range(len(s) - len(t), -1, -1):
cnt = 0
for j in range(len(t)):
if s[j + i] == "?" or s[j + i] == t[j]:
cnt += 1
else:
break
if cnt == len(t):
for j in range(len(s)):
if i <= j < j + len(t):
... |
s272508726 | p03565 | u437638594 | 1566014790 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 552 | S_dash = input()
T = input()
len_S = len(S_dash)
len_T = len(T)
answer = "UNRESTORABLE"
candidate = []
# まず T と一致させられる位置があるかを調べる
for i in range(len_S - len_T + 1):
# print(S_dash[i:i+len_T])
tmp = S_dash[i:i+len_T]
count = 0
for s, t in zip(tmp, T):
if s == t or s == '?':
count += 1
if count =... |
s595367524 | p03565 | u204523044 | 1565906758 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3444 | 987 | import copy
Sd = list(input())
T = list(input())
S = copy.deepcopy(Sd)
flag = 0
for i in range(len(Sd)-len(T)+1):
if flag == 1:
break
for j in range(len(T)):
if Sd[i+j] != '?' and Sd[i+j] != T[j]:
Sd = S
flag = 0
break
elif Sd[i+j] == '?':
... |
s729296185 | p03565 | u798818115 | 1565899291 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 572 | s=list(input())
t=list(input())
S=s[::-1]
T=t[::-1]
for i in range(len(S)-len(T)+1):
for j in range(len(T)):
if T[j]==S[i+j]:
pass
elif S[i+j]=="?":
pass
else:
break
if j==(len(T)-1):
#for item in T:
... |
s414087214 | p03565 | u093500767 | 1565550764 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 453 | s2 = str(input())
l2 = len(s2)
t = str(input())
l = len(t)
count = 0
for i in range(0,l2-l+1):
string = s2[i:i+l]
for j in range(0,l):
if string[j] in [t[j],"?"]:
count += 1
if count==l:
s2[i:i+1] = t
change_count += 1
else:
br... |
s525774455 | p03565 | u672475305 | 1565282651 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 447 | s = input()
t = input()
sl = len(s)
tl = len(t)
lst = []
for i in range(sl):
if s[i] == t[0]:
lst.append(i)
k = []
for i in lst:
cnt = 0
for j in range(tl):
if s[i+j]==t[j] or s[i+j]=='?':
cnt += 1
if cnt == tl:
ans = s[:i] + t + s[i+tl:]
ans = ans... |
s812938873 | p03565 | u245870380 | 1564713484 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 542 | S = list(input())
T = list(input())
for i in range(len(S)):
if S[i] == T[0] or S[i] == '?':
for j in range(len(T)):
#print(T[j], S[i+j])
if T[j] != S[i+j] and S[i+j] != '?':
break
else:
for k in range(len(T)):
S[i+k] = T[k]
... |
s124697643 | p03565 | u394721319 | 1564700961 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 789 | S = input()[::-1]
T = input()[::-1]
s = len(S)
t = len(T)
i = 0
j = 0
flag = 0
while True:
if S[i] == '?' or S[i] == T[0]:
p = i
j = 0
while True:
if S[p] != '?' and S[j] != T[j]:
break
p += 1
j += 1
if j == t:
... |
s714095426 | p03565 | u394721319 | 1564700532 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 756 | S = input()[::-1]
T = input()[::-1]
s = len(S)
t = len(T)
i = 0
j = 0
flag = 0
while True:
if S[i] == '?' or S[i] == T[0]:
j = 0
while True:
if S[j] != '?' and S[j] != T[j]:
break
j += 1
if j == t:
flag = 1
ind = ... |
s798348133 | p03565 | u952022797 | 1564520224 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38384 | 1237 | # -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
... |
s318436175 | p03565 | u536377809 | 1564442200 | Python | Python (3.4.3) | py | Runtime Error | 2113 | 149876 | 521 | import itertools
S=input()
T=input()
n=len(T)
Thatena=[[T[j] if (i>>j)&1 else "?" for j in range(n)] for i in range(2**n)] #Tのうち0文字以上を?に置き換えたものの集合
#print(Thatena)
#print(len(Thatena))
ans=[]
for t in Thatena:
if S.find("".join(t))!=-1:
anslist.append(S.rfind("".join(t)))
break
if anslist==[]:
p... |
s305394866 | p03565 | u536377809 | 1564441619 | Python | Python (3.4.3) | py | Runtime Error | 2113 | 149876 | 427 | import itertools
S=input()
T=input()
n=len(T)
Thatena=[[T[j] if (i>>j)&1 else "?" for j in range(n)] for i in range(2**n)] #Tのうち0文字以上を?に置き換えたものの集合
#print(Thatena)
#print(len(Thatena))
anslist=[S.find("".join(t)) for t in Thatena if S.find("".join(t))!=-1]
#print(anslist[0],anslist[0]+len(T))
ans=S[:anslist[0]]+T+S[an... |
s060134836 | p03565 | u536377809 | 1564439821 | Python | Python (3.4.3) | py | Runtime Error | 2225 | 1813156 | 494 | import itertools
S=input()
T=input()
def insert_hint(item,hintindex,S):
for i in hintindex:
item.insert(i,S[i])
return item
hintindex=[n for _,n in enumerate(range(len(S))) if S[n]!="?"]
zenbu=list(itertools.permutations(
list("abcdefghijklmnopqrstuvwxyz"),
len(S)-len(hintindex)
))
zenbu=[insert_hint(l... |
s383103605 | p03565 | u536377809 | 1564439738 | Python | Python (3.4.3) | py | Runtime Error | 2222 | 1832480 | 493 | import itertools
S=input()
T=input()
def insert_hint(item,hintindex,S):
for i in hintindex:
item.insert(i,S[i])
return item
hintindex=[n for _,n in enumerate(range(len(S))) if S[n]!="?"]
zenbu=list(itertools.permutations(
list("abcdefghijklmnopqrstuvwxyz"),
len(S)-len(hintindex)
))
zenbu=[insert_hint(l... |
s284894314 | p03565 | u676059589 | 1563817297 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 327 | s = input()
t = input()
passlist = []
for i in reversed(range(1,len(s)-len(t)+2)):
u = s[i-1:i+len(t)-1]
flag = True
for i in range(len(u)):
if(u[i] != '?' and u[i] != t[i]):
flag = False
if flag:
text = (s[:i-2] + t + s[-1+len(t)-1+i:]).replace('?','a')
passlist.append(text)
passlist.sort()
print(passlis... |
s228975195 | p03565 | u970899068 | 1563666839 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 501 | s=input()
t=input()
u=''
v=[]
count=0
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if t[j]==s[i+j] or s[i+j]=='?':
count+=1
if count==len(t):
for k in range(len(s)):
if k>=i:
u+=t[k-i]
elif s[k]=='?':
u+='a'
... |
s392261481 | p03565 | u970899068 | 1563666711 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 460 | s=input()
t=input()
u=''
v=[]
count=0
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if t[j]==s[i+j] or s[i+j]=='?':
count+=1
if count==len(t):
for k in range(len(s)):
if k>=i:
u+=t[k-i]
elif s[k]=='?':
u+='a'
... |
s503340415 | p03565 | u191874006 | 1563034498 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38512 | 776 | #!/usr/bin/env python3
#ABC76 C
s = list(input())
t = list(input())
ns = len(s)
nt = len(t)
f = 0
for i in range(ns):
if s[i] in t:
ind = t.index(s[i])
for j in range(i-ind,i-ind+nt):
if s[j] == t[j-i+ind] or s[j] == '?':
continue
else:
break... |
s878374607 | p03565 | u191874006 | 1563034437 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38384 | 776 | #!/usr/bin/env python3
#ABC76 C
s = list(input())
t = list(input())
ns = len(s)
nt = len(t)
f = 0
for i in range(ns):
if s[i] in t:
ind = t.index(s[i])
for j in range(i-ind,i-ind+nt):
if s[j] == t[j-i+ind] or s[j] == '?':
continue
else:
break... |
s730147943 | p03565 | u780675733 | 1561606609 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 363 | S = input()
T = input()
slide_num = len(S) - len(T)
if slide_num < 0:
exit()
for slide in range(slide_num+1):
for j in range(len(S)-slide):
if S[j+slide] == T[j] or S[j+slide] == '?':
None
else:
break
else:
print((S[:slide] + T + S[slide+len(T):]).replace('?',... |
s911301153 | p03565 | u780675733 | 1561606492 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 355 | S = input()
T = input()
slide_num = len(S) - len(T)
if slide_num < 0:
exit()
for slide in range(slide_num+1):
for j in range(len(S)-slide):
if S[j+slide] == T[j] or S[j+slide] == '?':
None
else:
break
else:
print((S[:2] + T + S[2+len(T):]).replace('?', 'a'))
... |
s702835021 | p03565 | u780675733 | 1561606444 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 353 | S = input()
T = input()
slide_num = len(S) - len(T)
if slide_num < 0:
pass
for slide in range(slide_num+1):
for j in range(len(S)-slide):
if S[j+slide] == T[j] or S[j+slide] == '?':
None
else:
break
else:
print((S[:2] + T + S[2+len(T):]).replace('?', 'a'))
... |
s426327784 | p03565 | u170324846 | 1561389326 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 39408 | 739 | def output(S,T,i,j):
op = ""
for k in S[:j-i]:
if k == "?":
op += "a"
else:
op += k
op += T
if j-i+len(T) < len(S):
for k in S[j-i+len(T):]:
if k == "?":
op += "a"
else:
op += i
return op
S = input()
T = input()
SS = len(S)
TT = len(T)
cand = []
if TT > SS... |
s224623503 | p03565 | u170324846 | 1561388705 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 39408 | 747 | def output(S,T,i,j):
op = ""
for k in S[:j-i]:
if k == "?":
op += "a"
else:
op += k
op += T
if j-i+len(T) < len(S):
for k in S[j-i+len(T):]:
if k == "?":
op += "a"
else:
op += i
return op
S = input()
T = input()
SS = len(S)
TT = len(T)
cand = []
if TT > SS... |
s428202874 | p03565 | u170324846 | 1561388466 | Python | PyPy3 (2.4.0) | py | Runtime Error | 187 | 39408 | 697 | def output(S,T,i,j):
op = ""
for k in S[:j-i]:
if k == "?":
op += "a"
else:
op += k
op += T
if j-i+len(T) < len(S):
for k in S[j-i+len(T):]:
if k == "?":
op += "a"
else:
op += i
return op
S = input()
T = input()
SS = len(S)
TT = len(T)
cand = []
for i,t in... |
s936459678 | p03565 | u350997995 | 1560945657 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 656 | S = list(input())
T = list(input())
if len(S)<len(T):
print("UNRESTORABLE")
exit()
l = 0
S = S[::-1]
T = T[::-1]
for s in range(len(S)-len(T)+1):
if S[s]=="?" or S[s] == T[0]:
k = 0
for t in range(len(T)):
if S[s+t]!="?" and S[s+t]!=T[t]:
break
else:
... |
s454880275 | p03565 | u350997995 | 1560945442 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 628 | S = list(input())
T = list(input())
if len(S)<len(T):
print("UNRESTORABLE")
exit()
l = 0
for s in range(len(S)-len(T)+1):
if S[s]=="?" or S[s] == T[0]:
k = 0
for t in range(len(T)):
if S[s+t]!="?" and S[s+t]!=T[t]:
break
else:
k+=1
... |
s654009226 | p03565 | u350997995 | 1560945372 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 573 | S = list(input())
T = list(input())
l = 0
for s in range(len(S)-len(T)+1):
if S[s]=="?" or S[s] == T[0]:
k = 0
for t in range(len(T)):
if S[s+t]!="?" and S[s+t]!=T[t]:
break
else:
k+=1
if k==len(T):
l = s
break
if k<len(T):
... |
s934049127 | p03565 | u864453204 | 1560708769 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3312 | 388 | import re
s = list(input())
t = list(input())
ls = len(s)
lt = len(t)
if ls < lt:
print('UNRESTORABLE')
else:
ans = []
for i in range(len(s) - len(t) + 1):
m = re.match(s[i:i + lt], t)
if m is None:
continue
ans.append((s[:i]+t+s[i+lt:]).replace('?', 'a'))
if not a... |
s227519104 | p03565 | u177756077 | 1560380921 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 387 | N=int(input())
F=[]
P=[]
for _ in range(N):
F.append(list(map(int,input().split())))
for _ in range(N):
P.append(list(map(int,input().split())))
m=2**10
gain=-10**8
for i in range(1,2**10):
x=list(map(int,format(i,'b').zfill(10)))
sumP=0
for j in range(N):
total=sum([a*b for a,b in zip(x,F[... |
s865337172 | p03565 | u386819480 | 1559946753 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 936 | #!/usr/bin/env python3
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
# Failed to predict input format
St = list(input())
T = input()
# print(len(T))
f = False
f... |
s995390846 | p03565 | u386819480 | 1559946578 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 941 | #!/usr/bin/env python3
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
# Failed to predict input format
St = list(input())
T = input()
# print(len(T))
f = False
f... |
s975969395 | p03565 | u722535636 | 1559930462 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 290 | s=list(input())
t=list(input())
if len(s)<len(t):print('UNRESTORABLE')
else:
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if s[i+j] not in ['?',t[j]]:break
else:
s[i:i+len(t)]=t
break
else:
print('UNRESTORABLE')
exit()
print(''.join(s).replace('?','a')) |
s197162162 | p03565 | u129836004 | 1559688174 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 540 | S = input()
T = input()
n = len(S)
t = len(T)
ans = ''
for i in range(t, n+1):
flag = True
for j in range(t):
if S[-i+j] != '?' and S[-i+j] != T[j]:
flag = False
break
if flag:
break
if flag:
for s in S[:-i]:
if s == '?':
ans += 'a'
els... |
s233575999 | p03565 | u129836004 | 1559687343 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 413 | S = input()
T = input()
n = len(S)
t = len(T)
ans = ''
for i in range(t, n+1):
flag = True
for j in range(t):
if S[-i+j] != '?' and S[-i+j] != T[j]:
flag = False
break
if flag:
break
if flag:
for s in S[:-i]:
if s == '?':
ans += 'a'
els... |
s251687970 | p03565 | u777028980 | 1559335167 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 295 | hoge=input()
key=input()
ans=[]
for i in range(len(hoge)-len(key)+1):
flag=0
for j in range(len(key)):
if(hoge[i+j]==key[j] or hoge[i+j]=="?"):
flag+=1
if(flag==len(key)):
kari=hoge[:i]+key+hoge[i+len(key):]
ans.append(kari.replace("?","a"))
ans.sort()
print(ans[0]) |
s484647193 | p03565 | u614314290 | 1559162802 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 407 | S = list(input())[::-1]
T = list(input())[::-1]
i, c = 0, False
while True:
f = False
for j, t in enumerate(T):
if t == S[i + j]:
f = True
continue
if "?" == S[i + j]:
continue
break
else:
if f:
S[i:i + len(T)] = T
i += len(T) - 1
c = True
#print(S)
i += 1
if (len(S) - len(T)) <= i:
... |
s478201744 | p03565 | u500944229 | 1558413085 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 389 | s = input()
t = input()
cont = 0
y = s[::-1]
for i,x in enumerate(y):
print(i,y[i])
if x == "?":
cont += 1
if cont == len(t):
break
elif (cont == len(t)-1)&(y[i+1] == t[0]):
break
else:
cont = 0
if cont == 0:
print("UNRESTORABLE")
els... |
s011553470 | p03565 | u500944229 | 1558412907 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 380 | s = input()
t = input()
y = s[::-1]
for i,x in enumerate(y):
print(i,y[i])
if x == "?":
cont += 1
if cont == len(t):
break
elif (cont == len(t)-1)&(y[i+1] == t[0]):
break
else:
cont = 0
if cont == 0:
print("UNRESTORABLE")
else:
pr... |
s678123153 | p03565 | u030848580 | 1557954741 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 557 | # coding: utf-8
# Your code here!
words= list(input())
target = list(input())
for i in reversed(range(len(words)-len(target)+1)):
# print(words[i],i)
flag = True
for j in range(len(target)):
if not(words[i+j] == target[j] or words[i+j] == '?'):
flag = False
break
if flag... |
s008011115 | p03565 | u030848580 | 1557953981 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 642 | # coding: utf-8
# Your code here!
words= list(input())
target = list(input())
for i in reversed(range(len(words)-len(target)+1)):
# print(words[i])
flag = True
for j in range(len(target)):
if not(words[i+j] == target[j] or words[i+j] == '?'):
flag = False
break
if flag i... |
s929188362 | p03565 | u501163846 | 1557251139 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 584 | s=list(str(input()))
t=list(str(input()))
if len(s)<len(t):
print("UNRESTORABLE")
else:
sn=len(s)
tn=len(t)
for i in range(sn-tn+1):
flag=True
for k in range(tn):
if s[i+k]==t[k] or s[i+k]=="?":
pass
else:
flag=False
... |
s099642671 | p03565 | u055941944 | 1557031048 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 369 | s=input()
t=input()
if len(s) < len(t):
print("UNRESTORABLE")
exit()
c=len(s)-len(t)
flg=False
while True:
if c<0:
break
flg2=True
for i in range(len(t)):
if s[c+i]!=t[i] and s[c+i]!="?":
flg2=False
if flg2:
flg=True
break
c-=1
#print(c)
if flg:
print((s[:c]+t+s[c+len(t):])... |
s535000635 | p03565 | u361243145 | 1557011719 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 464 | S = input()
T = input()
# Tが当てはまる？
s = 0 # Tが当てはまる最初のインデックス
for i in range(len(S)-len(T)+1):
flag = 1
for j in range(len(T)):
if S[i+j] != "?" and S[i+j] != T[j]:
flag = 0
if flag:
s = i
break
if not flag:
print("UNRESTORABLE")
else: # Tが当てはまった場合
S = S[:s] + T +... |
s131022695 | p03565 | u334904929 | 1556938270 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 283 | s = input()
t = input()
ptr = []
for i in range(len(s)-len(t),-1,-1):
for j in range(len(t)):
if(t[j] != s[i+j] and s[i+j] != '?'):
break
else:
ptr = i
ans = s[0:ptr].replace('?','a') + t + s[ptr+len(t):].replace('?','a')
break
else:
print('UNRESTORABLE')
print(ans) |
s354433127 | p03565 | u030848580 | 1556811889 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 580 | # coding: utf-8
# Your code here!
words= list(input())
target = list(input())
i=len(words)-len(target)
for i in reversed(range(len(words)-len(target)+1)):
# print(words[i])
flag = True
for j in range(len(target)):
if not(words[i+j] == target[j] or words[i+j] == '?'):
flag = False
... |
s973123505 | p03565 | u030848580 | 1556811651 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 528 | # coding: utf-8
# Your code here!
words= list(input())
target = list(input())
i=len(words)-len(target)
while(0<=i):
flag = True
for j in range(len(target)):
if not(words[i+j] == target[j] or words[i+j] == '?'):
flag = False
break
if flag is True:
words[i:i+len(target... |
s880706396 | p03565 | u030848580 | 1556811415 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 510 | # coding: utf-8
# Your code here!
words= list(input())
target = list(input())
i=len(words)-len(target)
while(0<=i):
flag = True
for j in range(len(target)):
if not(words[i+j] == target[j] or words[i+j] == '?'):
flag = False
if flag is True:
words[i:i+len(target)] = target
... |
s223315251 | p03565 | u969190727 | 1556582857 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 371 | s=input()
t=input()
ans="z"*len(s)
flag=0
for i in range(2**len(t)):
K=str(bin(i))[2:].zfill(5)
T=""
for j in range(len(t)):
if K[j]=="0":
T+="?"
else:
T+=t[j]
for k in range(len(s)-len(t)+1):
if s[k:k+len(t)]==T:
Key=s[:k]+t+s[k+len(t):]
ans=min(ans,Key.replace("?","a"))
... |
s754158206 | p03565 | u404710939 | 1556469525 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 508 | S = input()
T = input()
N = len(T)
flag = False
pos = 51
ans = ""
for i in range(len(S)-4):
cnt = 0
for j in range(N):
if S[i+j] == "?" or S[i+j] == T[j]:
cnt += 1
else:
break
if cnt == N:
pos = i
flag = True
if flag:
for i in range(len(S)):
... |
s050534829 | p03565 | u404710939 | 1556469422 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 522 | S = input()
T = input()
N = len(T)
flag = False
pos = 51
ans = ""
for i in range(len(S)-4):
cnt = 0
for j in range(N):
if S[i+j] == "?" or S[i+j] == T[j]:
cnt += 1
else:
break
if cnt == N:
pos = i
flag = True
break
if flag:
for i in range(... |
s709925291 | p03565 | u806855121 | 1556400131 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1118 | SD = input()
T = input()
for i, ch in enumerate(T):
if ch in SD:
n = SD.find(ch)
flag = True
c = 0
for j in range(n-1, n-i, -1):
if j < 0:
flag = False
break
if SD[j] != '?' and SD[j] != T[i-c]:
flag = False
... |
s568540833 | p03565 | u806855121 | 1556400087 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1117 | SD = input()
T = input()
for i, ch in enumerate(T):
if ch in SD:
n = SD.find(ch)
flag = True
c = 0
for j in range(n-1, n-i, -1):
if j < 0:
flag = False
break
if SD[j] != '?' and SD[j] != T[i-c]:
flag = False
... |
s344940954 | p03565 | u795630164 | 1556076668 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 500 | S = input()
T = input()
s = len(S)
t = len(T)
for i in range(s-t, -1, -1):
n = 0
for j in range(t-1, -1, -1):
if S[j+i] != '?' and S[j+i] != T[j]:
break
n += 1
if n == t:
for x in range(s):
if i <= x <= i+t:
print(T[x-i], end='')
... |
s412044938 | p03565 | u103902792 | 1555987501 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 347 | s = input()[::-1]
t = input()[::-1]
for i,c in enumerate(s):
if (c == t[0] or c == '?') and (i+len(t) < len(s)-1):
for j in range(len(t)):
if t[j] != s[i+j] and s[i+j] != '?':
break
else:
for j in range(len(t)):
s[i+j] = t[j]
print(s.replace('?', 'a')[::-1])
break
else... |
s773741620 | p03565 | u103902792 | 1555987386 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 331 | s = input()[::-1]
t = input()[::-1]
for i,c in enumerate(s):
if c == t[0] and (i+len(t) < len(s)):
for j in range(len(t)):
if t[j] != s[i+j] and s[i+j] != '?':
break
else:
for j in range(len(t)):
s[i+j] = t[j]
print(s.replace('?', 'a')[::-1])
break
else:
print('UNRES... |
s416980902 | p03565 | u103902792 | 1555987371 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 331 | s = input()[::-1]
t = input()[::-1]
for i,c in enumerate(s):
if c == t[0] and (i+len(t) < len(s)):
for j in range(len(t)):
if t[j] != s[i+j] and s[i+j] != '?':
break
else:
for j in range(len(t)):
s[i+j] = t[j]
print(s.replace('?', 'a')[;;-1])
break
else:
print('UNRES... |
s827871707 | p03565 | u103902792 | 1555987323 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 325 | s = input()[::-1]
t = input()[::-1]
for i,c in enumerate(s):
if c == t[0] and (i+len(t) < len(s)):
for j in range(len(t)):
if t[j] != s[i+j] and s[i+j] != '?':
break
else:
for j in range(len(t)):
s[i+j] = t[j]
print(s.replace('?', 'a'))
break
else:
print('UNRESTORABL... |
s221729679 | p03565 | u103902792 | 1555987108 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 251 | s = input()[::-1]
t = input()[::-1]
for i,c in enumerate(s):
if c == t[0]:
for j in range(len(t)):
if t[j] != s[i+j] and s[i+j] != '?':
break
else:
for j in range(len(t)):
s[i+j] = t[j]
print(s.replace('?', 'a')) |
s516561058 | p03565 | u622523700 | 1555800762 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 308 | nt = len(t)
if ns < nt:
print("UNRESTORABLE")
else:
for i in range(ns - nt + 1):
if all([s[i + j] == "?" or s[i + j] == t[j] for j in range(nt)]):
ans = s[:i] + t + s[i + nt:]
ans = ans.replace("?", "a")
print(ans)
exit()
print("UNRESTORABLE") |
s949781047 | p03565 | u037430802 | 1555707732 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 432 | s_dash = input()
t = input()
n = len(s_dash)
m = len(t)
f n < m:
print("UNRESTORABLE")
exit()
for i in range(n - m + 1):
flag = True
for j in range(m):
if s_dash[i+j] != "?" and s_dash[i+j] != t[j]:
flag = False
break
if flag:
ans = list(s_dash)
ans[i:i+m] = list... |
s704049501 | p03565 | u037430802 | 1555706854 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 379 | s_dash = input()
t = input()
n = len(s)
m = len(t)
for i in range(n - m + 1):
flag = True
for j in range(m):
if s_dash[i+j] != "?" and s_dash[i+j] != t[j]:
flag = False
break
if flag:
ans = list(s_dash)
ans[i:i+m] = list(t)
ans = "".join(ans).replace("?", "a")
... |
s255627191 | p03565 | u037430802 | 1555706794 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 379 | s_dash = input()
t = input()
n = len(s)
m = len(t)
for i in range(n - m + 1):
flag = True
for j in range(m):
if s_dash[i+j] != "?" and s_dash[i+j] != t[j]:
flag = False
break
if flag:
ans = list(s_dash)
ans[i:i+m] = list(t)
ans = "".join(ans).replace("?", "a")
... |
s183437187 | p03565 | u037430802 | 1555705078 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 374 | s = input()
t = input()
n = len(s)
m = len(t)
for i in range(n - m + 1):
flag = True
for j in range(m):
if s_dash[i+j] != "?" and s_dash[i+j] != t[j]:
flag = False
break
if flag:
ans = list(s_dash)
ans[i:i+m] = list(t)
ans = "".join(ans).replace("?", "a")
print... |
s444466561 | p03565 | u037430802 | 1555704259 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 754 | s = input()
t = input()
n = len(s)
m = len(t)
ans = []
for i in range(n - m + 1):
flag = True
for j in range(m):
if s[i+j] != '?' and s[i+j] != t[j]:
flag = False
break
if flag:
ans.append(s[:i].replace('?', 'a') + t + s[i+m:].replace('?', 'a'))
if ans == []:
prin... |
s009476892 | p03565 | u037430802 | 1555704055 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 473 | s_dash = input()
t = input()
n = len(s_dash)
m = len(t)
if n < m:
print("UNRESTORABLE")
exit()
for i in range(n - m + 1):
flag = True
for j in range(m):
if s_dash[i+j] != '?' and s_dash[i+j] != t[j]:
flag = False
break
if flag:
#範囲外をaに置き換える
ans = list(s_da... |
s545839163 | p03565 | u037430802 | 1555703698 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 543 | s_dash = input()
t = input()
n = len(s_dash)
m = len(t)
if n < m:
print("UNRESTORABLE")
exit()
ans = []
for i in range(n-m+1):
flag = True
for j in range(m):
if s_dash[i+j] != "?" and s_dash[i+j] != t[j]:
if s_dash[i+j] != '?' and s_dash[i+j] != t[j]:
flag = False
break
if flag:
... |
s074955659 | p03565 | u037430802 | 1555703152 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 408 | s_dash = input()
t = input()
ans = []
for i in range(len(s_dash)-len(t)+1):
flag = True
for j in range(len(t)):
if s_dash[i+j] != "?" and s_dash[i+j] != t[j]:
flag = false
break
if flag:
#範囲外をaに置き換える
ans.append(s_dash[:i].replace("?", "a") + t + s_dash[i+len(t):].replace("?", "a"))
... |
s418872690 | p03565 | u014322467 | 1555177046 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 625 | input_A = input()
input_T = input()
input_A, input_T = list(input_A), list(input_T)
if len(input_A) >= len(input_T):
for i in range(len(input_A)-len(input_T), -1, -1):
clear_flg = True
for j in range(len(input_T)):
if not (input_A[i + j] == '?' or input_A[i + j] == input_T[j]):
... |
s349208389 | p03565 | u014322467 | 1555176545 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 494 | input_A = input()
input_T = input()
input_A, input_T = list(input_A), list(input_T)
for i in range(len(input_A)-len(input_T), 0, -1):
clear_flg = True
for j in range(len(input_T)):
if not (input_A[i + j] == '?' or input_A[i + j] == input_T[j]):
clear_flg = False
break
if cl... |
s317420494 | p03565 | u565204025 | 1555120749 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 649 | # -*- coding: utf-8 -*-
s = list(input())
t = list(input())
slen = len(s)
tlen = len(t)
cand = []
for i in range(slen - tlen + 1):
match = True
for j in range(tlen):
if s[i + j] == "?" or s[i + j] == t[j]:
pass
else:
match = False
if match:
cand.append(i)
... |
s132459184 | p03565 | u278260569 | 1555035887 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 483 | S = list(input())
T = list(input())
i = len(S) - 1
j = len(T) - 1
start_T = 100
while i >= 0:
if S[i] == T[j] or S[i] == "?":
j -= 1
i -= 1
if j == -1:
start_T = i + 1
break
else:
j = len(T) - 1
i -= 1
if start_T == 100:
ans = UNRESTORABLE
else:
ans = ""
k = 0
while k < len(S):
if k == start_T... |
s774619765 | p03565 | u239204773 | 1555009197 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 2563 | #文字列Tを突っ込むのはできるだけ最後の方が良い(残りは全てaにしないと辞書順で負けうる。)
#if 文字列が入らない→UNRESTORABLE
#if 文字列が入ったら全部aを入れられる。(ん？これってここまでやったら絶対に一番最初のやつになるのでは?)
#※すでに文字が入っていたら、文字列を入れずに全てaを突っ込む
#文字列をどうやって探すか。
#Tの長さと同じだけ?が連続している場所があるならいける
#というか一文字ずつみて(その文字or?ならオーケー)失敗したらindexを戻していけばいいので
def strProduct(S,T):
Tindex = 0#Tのindex失敗するたびに0に戻る
lt = l... |
s944224249 | p03565 | u333768710 | 1554951214 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 725 | if __name__ == '__main__':
hidden_key = input()
flag_string = input()
key_length = len(hidden_key)
flag_length = len(flag_string)
key_list = list(hidden_key.replace('?', 'a'))
for i in reversed(range(key_length - flag_length + 1)):
part_key = hidden_key[i:i + flag_length]
is_m... |
s170358646 | p03565 | u466331465 | 1554789722 | Python | Python (3.4.3) | py | Runtime Error | 33 | 3572 | 1216 | 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]:
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.