# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
486296 | 2021-11-11T08:09:16 Z | NintsiChkhaidze | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "garder.h" using namespace std; int kth(int k); void say_answer(int k); int cnt(int k); void solve(int n){ set <int> st; st.clear(); for (int i = 1; i <= n; i++){ int val = kth(i); if (st.find(val)!=st.end()) continue; st.insert(val); if (cnt(val) > n/3) say_answer(val); } say_answer(-1); }