-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathExam.cpp
More file actions
71 lines (66 loc) · 1.67 KB
/
Exam.cpp
File metadata and controls
71 lines (66 loc) · 1.67 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define pb push_back
#define endl "\n"
#define flash \
ios_base ::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define cc continue
#define bb break
#define ssort(a) sort(a.begin(), a.end());
#define pll pair<ll, ll>
#define mp make_pair
const ll GEN = 2e5 + 1, MOD = 1e9 + 7, OO = 1e18 + 10;
// N S W E
vector<pll> DxDy = {{-1,0},{1,0},{0,-1},{0,1}};
// SE SW NE NW
vector<pll> DiaXY = {{1,1},{1,-1},{-1,1},{-1,-1}};
string path = "UDLR";
string alpha = "abcdefghijklmnopqrstuvwxyz";
string numeric = "0123456789";
bool compare(pair<ll, ll> v1, pair<ll, ll> v2){return v1.first < v2.first;}
bool powerof2(ll n){return n && !(n & (n-1));}
bool win(int a, int b) {
return a > b;
}
void lets_do_it() {
string s,t;
cin>>s>>t;
ll i = 0,j = 0;
while(i<s.length() && j<t.length()){
if(s[i] == t[j]){
i++;
j++;
}else if(s[i] == '?'){
s[i] = t[j];
i++;
j++;
}else{
i++;
}
}
if(i>=s.length() && j<t.length()){
cout<<"NO"<<endl;
}else{
cout<<"YES"<<endl;
for(int i=0;i<s.length();i++){
if(s[i] == '?'){
s[i] = 'a';
}
}
cout<<s<<endl;
}
}
int main(){
flash;
ll num = 1;
cin>>num;
while(num--){
lets_do_it();
}
// cerr << "Time : " << 1000 * ((double)clock()) / CLOCKS_PER_SEC << "ms" << endl;
}