Submission #3598916


Source Code Expand

S_hint=input()
T=input()
List_S_hint=list(S_hint)
S_candidates=[]
Out=0
for i in range(len(S_hint)-len(T)+1):
  Out=0
  Word=""
  Candidate=list(List_S_hint)
  for j in range(len(T)):
    if Candidate[i+j] is "?":
      Candidate[i+j]=T[j]
    elif Candidate[i+j]==T[j]:
      pass
    else:
      Out=1
      break
  if Out==1:
    pass
  else:
    for n in Candidate:
      if n=="?":
        Word+="a"
      else:
        Word+=n
    S_candidates.append(Word)  
if len(S_candidates)==0:
  print("UNRESTORABLE")
else:  
  print(min(S_candidates))      
      
      

Submission Info

Submission Time
Task C - Dubious Document 2
User Chanyuh
Language Python (3.4.3)
Score 300
Code Size 599 Byte
Status AC
Exec Time 18 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 14
Set Name Test Cases
Sample s1.txt, s2.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
in01.txt AC 18 ms 3064 KB
in02.txt AC 18 ms 3064 KB
in03.txt AC 18 ms 3064 KB
in04.txt AC 18 ms 3064 KB
in05.txt AC 18 ms 3064 KB
in06.txt AC 18 ms 3064 KB
in07.txt AC 18 ms 3064 KB
in08.txt AC 18 ms 3064 KB
in09.txt AC 18 ms 3064 KB
in10.txt AC 18 ms 3064 KB
in11.txt AC 18 ms 3064 KB
in12.txt AC 18 ms 3064 KB
s1.txt AC 18 ms 3064 KB
s2.txt AC 18 ms 3064 KB