#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
string s[101];
cin >> n;
for(int i = 0; i < n; i++) cin >> s[i];
string t;
cin >> t;
int sz = t.length();
string g = "***ABCDEFGHIJKLMNOPQRSTUVWXYZ***";
bool arr[32];
memset(arr, 0 ,sizeof(arr));
for(int i = 0; i < n; i++){
string sub = s[i].substr(0, sz);
if(sub == t) arr[g.find(s[i][sz])] = 1;
}
for(int i = 0, add = 0; i < 4; i++, add += 8){
for(int j = 0; j < 8; j++){
if(arr[j + add]) cout << g[j + add];
else cout << '*';
}
cout << endl;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
504 KB |
Output is correct |
3 |
Correct |
2 ms |
504 KB |
Output is correct |
4 |
Correct |
2 ms |
528 KB |
Output is correct |
5 |
Correct |
2 ms |
640 KB |
Output is correct |
6 |
Correct |
2 ms |
644 KB |
Output is correct |
7 |
Correct |
2 ms |
648 KB |
Output is correct |
8 |
Correct |
2 ms |
652 KB |
Output is correct |
9 |
Correct |
2 ms |
660 KB |
Output is correct |
10 |
Correct |
2 ms |
664 KB |
Output is correct |