Submission #4068845


Source Code Expand

#include <iostream>
#include <cstring>

using namespace std;

const int maxn = 51;
char s[maxn],t[maxn];

void output(int p){
    for(int i=p,j=0;j<strlen(t);i++,j++){
        s[i]=t[j];
    }
    for(int i=0;i<strlen(s);i++){
        if(s[i]=='?')
            s[i]='a';
    }
    cout<<s;
}

int main(){
    cin>>s;
    cin>>t;
    for(int i=0;i<strlen(s);i++){
        for(int j=i,k=0;k<strlen(t);j++,k++){
            if((s[j]==t[k])||(s[j]=='?')){
                if(k==strlen(t)-1){
                    output(i);
                    return 0;
                }
            }
            else{break;}
        }
    }
    cout<<"UNRESTORABLE";
    return 0;
}

Submission Info

Submission Time
Task C - Dubious Document 2
User vjudge5
Language C++14 (GCC 5.4.1)
Score 0
Code Size 664 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 11
WA × 3
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 WA 1 ms 256 KB
in02.txt AC 1 ms 256 KB
in03.txt AC 1 ms 256 KB
in04.txt AC 1 ms 256 KB
in05.txt WA 1 ms 256 KB
in06.txt AC 1 ms 256 KB
in07.txt AC 1 ms 256 KB
in08.txt WA 1 ms 256 KB
in09.txt AC 1 ms 256 KB
in10.txt AC 1 ms 256 KB
in11.txt AC 1 ms 256 KB
in12.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB