# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994020 | vjudge1 | Kartomat (COCI17_kartomat) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 |
---|---|---|---|---|
Fetching results... |