# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1183705 | ivaziva | Memory (IOI10_memory) | C++20 | 1 ms | 408 KiB |
#include <bits/stdc++.h>
#include "grader.h"
#include "memory.h"
#define MAXN 30
int karta[2][MAXN];
void play()
{
for (int i=0;i<25;i++) karta[0][i]=karta[1][i]=-1;
for (int i=1;i<=50;i++)
{
char a=faceup(i);
if (karta[0][a-'A']==-1) karta[0][a-'A']=i;
else karta[1][a-'A']=i;
}
for (int i=0;i<25;i++) {faceup(karta[0][i]);faceup(karta[1][i]);}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |