# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
82459 | heon | Kartomat (COCI17_kartomat) | C++11 | 2 ms | 664 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(){
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;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |