# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
687599 | 2023-01-26T15:55:17 Z | Rares | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include <grader.h> using namespace std; void Solve (int N){ int op=0; srand (time (0)); vector <int> a; while (1){ int x=kth (rand ()); op++; if (op>=59){ say_answer (-1); break; } bool ok=0; for (int i=0;i<a.size ();++i){ if (a[i]==x){ ok=1; break; } } if (ok==0){ a.push_back (x); int f=cnt (x); op++; if (f>N/3){ say_answer (x); break; } if (op>=59){ say_answer (-1); } } } }