// #ifdef __AVX2__ // #pragma GCC target "avx2" // #endif // #pragma GCC optimize "O3" // #pragma GCC optimize "unroll-loops" #include <bits/stdc++.h> #include <random> #include "grader.h" // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; // #define int long long #define elif else if #define all(l) begin(l),end(l) #define rall(l) rbegin(l),rend(l) #define append push_back #define print(l) for(auto i:l) cout<<i<<' '; cout<<endl; #define pprint(a,b) cout<<a<<' '<<b<<endl; #define inp(l) for(auto &i:l) cin>>i; // #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define pai make_pair #define endl "\n" #define pii pair<int,int> #define fi first #define se second #define vec vector // const int mod=998244353; const int mod1=998244353; const int mod=1e9+7; const int N=2e5+5; int iter=1,itera=1; void solve(int n){ random_device rd; mt19937 gen(rd()); uniform_int_distribution<> distrib(1, n); map<int,bool>d; for(int i=0;i<min(n,25);i++){ int g=distrib(gen); while(d[g]){ g=distrib(gen); } int x=kth(g); if(cnt(x)>n/3){ return x; } } }

consul.cpp: In function 'void solve(int)':
consul.cpp:47:24: error: return-statement with a value, in function returning 'void' [-fpermissive]
   47 |                 return x;
      |                        ^