# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240824 | SamAnd | Kartomat (COCI17_kartomat) | C++17 | 5 ms | 384 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;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
char s[4][10] =
{
"***ABCDE",
"FGHIJKLM",
"NOPQRSTU",
"VWXYZ***"
};
bool c[4][10];
int n;
char a[55][102];
char b[102];
void solv()
{
scanf("%d", &n);
for (int i = 0; i < n; ++i)
scanf(" %s", a[i]);
scanf(" %s", b);
for (int i = 0; i < n; ++i)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |