#include "gap.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
long long findGap(int T, int N)
{
if(T==2){
vector<pair<ll,ll>> v;
long long n=N;
ll mn,mx;
ll tmp=1e18;
MinMax(1LL,tmp,&mn,&mx);
ll l=mn,r=mx;
long long rng=r-l;
long long sz=(rng+n-2LL)/(n-1LL);
for(ll i=l+sz;i<=r+sz-1;i+=sz+1LL){
ll lb=i-sz;
ll sec=i/sz;
//cout<<lb <<" " <<i <<"\n";
MinMax(lb,i,&mn,&mx);
if(mn!=-1) v.push_back({mn,mx});
}
ll ans=sz;
for(int i=0;i<(int)(v.size())-1;i++){
ans=max(ans,v[i+1].first-v[i].second);
}
return ans;
}
return 0;
}
