# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390890 | Sorting | Memory (IOI10_memory) | C++17 | 0 ms | 0 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 "grader.h"
#include "memory.h"
#include <bits/stdc++.h>
using namespcae std;
const int N = 50;
void play() {
int a[N + 1];
for(int i = 1; i <= N; ++i)
a[i] = faceup(i);
for(int i = 1; i <= N; ++i){
for(int j = i + 1; j <= N; ++j){
if(a[i] == a[j]){
faceup(i);
faceup(j);
}
}
}
}