# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
591326 | OmnitronX | Cards (LMIO19_korteles) | C++14 | 64 ms | 3448 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 <iostream>
#include <algorithm>
using namespace std;
using num = long long;
num gora[26][26];
num dol[26][26];
num lewo[26][26];
num prawo[26][26];
bool tab[26][26][26][26];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
num n;
num r = 0;
cin >> n;
for (num i = 0; i < n; ++i)
{
string s1;
string s2;
cin >> s1 >> s2;
num a = s1[0] - 65;
num b = s1[1] - 65;
num c = s2[0] - 65;
num d = s2[1] - 65;
++gora [a][b];
# | 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... |