# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151526 | asdasd | CONSUL (info1cup19_consul) | C++20 | 0 ms | 0 KiB |
//gm --- akezhon
#include <bits/stdc++.h>
#include "grader.h"
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NE r < tl || tr < l
#define double long double
// #define int long long
using namespace std;
const int N=2e5+7;
const int mod=998244353;
// const int inf=2e18;
void solve(int n){
map<int,int>mp;
for(int i=1; i <= n; i++){
mp[kth(i)]++;
}
for(auto i : mp){
if(i.S > n/3){
say_answer(i.F);
break;
}
}
}
void AlemAmenov(){
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int RealName=1;
// cin >> RealName;
// srand(time(0));
while(RealName--)
// AlemAmenov();
return 0;
}