# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427405 | 2021-06-14T14:57:32 Z | MilosMilutinovic | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KB |
#include "grader.h" #include <bits/stdc++.h> using namespace std; mt19937 rng(time(0)); void solve(int N) { for (int rep = 1; rep <= 25; rep++) { int pos = rng() % N + 1; int element = kth(pos); if (cnt(element) > n / 3) return element; } say_answer(-1); }