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