# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1041672 | kheira | 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 solve(){
map<char,int> Cards;
int C;
for (int C = 1; C <= 50; ++c){
char letterCard = faceup(C);
if (Cards.find(letterCard) != Cards.end())
{
int matchedCard = Cards[letterCard];
faceup(letterCard);
faceup(C);
return;
}
else
{
Cards[letterCard] = C;
}
}
}