# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341799 | marvenlee | 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"
#include <map>
using namespace std;
void play() {
int i;
char a, b;
map<char,int> mp;
int j=1;
for (i=1; i<=25; i++){
a = faceup(j);
if(mp.find(a)!=mp.end()){
b = faceup(mp.find(a)->second);
}
else {
mp[a]=j
j+=1;
b= faceup(j);
mp[b]=j;
}
j+=1;
}
return;
}