# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
345970 | victoriad | Memory (IOI10_memory) | C++14 | 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"
void play() {
int i;
int cards[50];
char a, b;
for (i=0; i<49; ++i) {
cards[i] = faceup(i);
cards[i+1]= faceup(i+1);
}
for(i=0;i<49;i++){
for(int x=i+1;x<50;x++){
if(cards[i]==cards[x]){
faceup(i);
faceup(x);
}
}
}
}
int main(){
void play();
return 0;
}