Submission #1135158

#TimeUsernameProblemLanguageResultExecution timeMemory
1135158lopkusCONSUL (info1cup19_consul)C++20
0 / 100
2 ms408 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; void solve(int n){ map<int,int> M; for(int i = 1; i <= n; i++) { M[kth(i)]+= 1; } for(auto it : M) { if(it.second >= n / 3) { say_answer(it.first); return; } } say_answer(- 1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...