# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1104170 | Tarela4ka | 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 <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <set>
using namespace std;
int faceup(int i);
void Solve(){
vector<char> let(51, '*');
for(int i = 1; i <= 50; i++)
let[i] = faceup(i);
for(int i = 1; i <= 50; i++){
for(int j = 1; j <= 50; j++){
if (let[i] == let[j] && i != j) {
faceup(i); faceup(j);
}
}
}
}