#include "richest.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0; i<(n); ++i)
#define pb push_back
#define pi pair<int,int>
#define f first
#define s second 
#define all(x) x.begin(), x.end()
int richest(int n, int t, int s) {
    if (t==1) {
        vector<int> f,s;
        forn(i,n) forn(j,i) {f.pb(j); s.pb(i);}
        auto z = ask(f,s);
        vector<pi> cnt(n);
        forn(i,n) cnt[i].s=i;
        for(auto&x:z) cnt[x].f++;
        sort(all(cnt));
        return cnt[n-1].s;
    }
    vector<int> a; forn(i,n) a.pb(i);
    for(int it=0; it<6; ++it) {
        vector<int> f,s;
        for(int i=0; i<a.size(); i+=2) {
            f.pb(a[i]);
            s.pb(a[i+1]);
        }
        auto z = ask(f,s);
        a = z;
    }
    vector<int> cnt(n);
    for(int it=0; it<3; ++it) {
        vector<int> f,s;
        for(int i=0; i<a.size(); i+=5) {
            for(int x=0; x<5; ++x) {
                for(int y=x+1; y<5; ++y) {
                    f.pb(a[i+x]);
                    s.pb(a[i+y]);
                }
            }
        }
        auto z = ask(f,s);
        for(auto&x:z) cnt[x]++;
        vector<int> b;
        forn(i,n) if (cnt[i]==4) b.pb(i);
        forn(i,n) cnt[i]=0;
        a=b;
    }
    vector<int> f,s;
    forn(i,125) forn(j,i) {f.pb(j); s.pb(i);}
    auto z = ask(f,s);
    for(auto&x:z) cnt[x]++;
    forn(i,n) if (cnt[i]==124) return i;
}

answer.code: In function ‘int richest(int, int, int)’:
answer.code:8:11: error: declaration of ‘std::vector<int> second’ shadows a parameter
    8 | #define s second
      |           ^~~~~~
answer.code:49:19: note: in expansion of macro ‘s’
   49 |     vector<int> f,s;
      |                   ^
answer.code:8:11: note: ‘int second’ previously declared here
    8 | #define s second
      |           ^
answer.code:10:31: note: in expansion of macro ‘s’
   10 | int richest(int n, int t, int s) {
      |                               ^
answer.code:54:1: warning: control reaches end of non-void function [-Wreturn-type]
   54 | }
      | ^