# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200057 | SamAnd | Cards (LMIO19_korteles) | C++17 | 249 ms | 11512 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;
const int K = 26, Q = 4;
int n;
bool c[K][K][K][K];
int a[(1 << Q)][K][K][K][K];
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; ++i)
{
char a[3][3];
scanf(" %s", a[0]);
scanf(" %s", a[1]);
c[a[0][0] - 'A'][a[0][1] - 'A'][a[1][0] - 'A'][a[1][1] - 'A'] = true;
}
for (int x = 0; x < (1 << Q); ++x)
{
int i[4];
for (i[0] = 0; i[0] < 26; ++i[0])
{
for (i[1] = 0; i[1] < 26; ++i[1])
{
for (i[2] = 0; i[2] < 26; ++i[2])
{
for (i[3] = 0; i[3] < 26; ++i[3])
{
if (!c[i[0]][i[1]][i[2]][i[3]])
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |