# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637595 | tvladm2009 | CONSUL (info1cup19_consul) | 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 <bits/stdc++.h>
#include <grader.h>
using namespace std;
void solve(int n) {
srand(time(NULL));
map<int, int> mp;
while (true) {
int x = rand() % n + 1;
if (mp.find(x)) {
continue;
}
mp[x] = true;
if (cnt(kth(x)) > n / 3) {
say_answer(x);
return;
}
}
say_answer(-1);
}