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 play(){
vector<char> let(51, '*');
for(int i = 1; i <= 50; i++)
let[i] = faceup(i);
set<char> s;
for(int i = 1; i <= 50; i++){
if (s.find(let[i]) == s.end()){
for(int j = 1; j <= 50; j++){
if (let[i] == let[j] && i != j) {
faceup(i); faceup(j);
s.insert(let[i]);
}
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |