#include<bits/stdc++.h>
using namespace std;
int main()
{
string key = "***ABCDEFGHIJKLMNOPQRSTUVWXYZ***";
int n;
cin >> n;
string s[n];
for(int i = 0; i < n; i ++)
cin >> s[i];
string t;
cin >> t;
set<char> st;
for(int i = 0; i < n; i ++)
if(s[i].substr(0, t.size()) == t)
st.insert(s[i][t.size()]);
for(char &i : key)
if(st.find(i) == st.end())
i = '*';
for(int i = 0; i < 4; i ++)
for(int j = 0; j < 8; j++)
cout << key[i * 8 + j] << " \n"[j == 7];
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |