# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
686989 | Alihan_8 | CONSUL (info1cup19_consul) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
int kth(int k);
void say_answer(int k);
int cnt(int k);
void solve(int n){
vector <int> res;
for ( int i = 1; i <= n; i++ ){
if ( kth(i)*3 > n ){
say_answer(i);
return;
}
}
say_answer(-1);
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << '\n';
}