# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1109841 | vjudge1 | Kartomat (COCI17_kartomat) | C++17 | 2 ms | 592 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>
#define F first
#define S second
#define LL long long
#define rep(i, x) for(auto &i : (x))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define left(x) ((x)<<1)
#define right(x) ((x)>>1)
#define LSOne(x) (x & -(x))
using namespace std;
using T = pair<pair<int, int>, int>;
const int SZ = 2e5 + 1;
const LL MOD = 1e9 + 7;
const LL INF = 1e18 + 1;
LL bp (LL b, LL e, LL m = MOD) {
if ( e == 0 ) return 1;
LL T = bp(b, e / 2);
T *= T; T %= m;
if ( e & 1 ) T *= b;
return T %= m;
}
LL nv_i (LL a) { return bp(a, MOD - 2); };
LL gcd (LL a, LL b) { return (b == 0 ? a : gcd(b, a % b)); }
LL lcm(LL a, LL b) { return (a * (b / gcd(a, b))); }
LL ceil (LL a, LL b) { return ((a + b - 1) / b); }
void solve() {
int n;
cin >> n;
vector<string> S(n);
for(int i = 0; i < n; i ++) {
cin >> S[i];
}
string ini;
cin >> ini;
map<char, bool> LETTERS;
for(int i = 0; i < n; i ++) {
bool a = 1;
for(int j = 0; j < ini.size(); j ++) {
if(ini[j] != S[i][j]) {
a = 0;
break;
}
}
if(a) {
LETTERS[S[i][ini.size()]] = 1;
}
}
char letter = 'A';
for(int i = 1; i <= 4; i ++) {
for(int j = 1; j <= 8; j ++) {
if(i == 1 && j <= 3) {
cout << '*';
continue;
}
if(i == 4 && j >= 6) {
cout << '*';
continue;
}
if(LETTERS[letter])
cout << letter;
else
cout << '*';
letter ++;
}
cout << "\n";
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |