# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993681 | 2024-06-06T10:06:12 Z | ramalzaher | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KB |
#include "grader.h" #include<bits/stdc++.h> using namespace std ; mt19937_64 randd(chrono::steady_clock::now().time_since_epoch().count()); void solve(int n) { bool ok=1; for(int i = 0 ;i < n; i ++ ) { int ans = kth(randd()%(n+1)) ; int temp = cnt(ans); if(temp > n/3 && ok ) { say_answer(res) ; ok=0; } if(!ok)break ; } if(ok==0) say_answer(-1) ; }