#include "gap.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 30001;
ll solve1(int N) {
ll l = 0, r = 1e18;
ll mn,mx;
vl v;
while (N) {
MinMax(l,r,&mn,&mx);
v.pb(mn); N --;
if (N) {
v.pb(mx); N --;
}
l = mn+1, r = mx-1;
}
sort(all(v));
ll ans = 0;
F0R(i,sz(v)-1) ans = max(ans,v[i+1]-v[i]);
return ans;
}
ll cdiv(ll a, ll b) {
return (a+b-1)/b;
}
ll solve2(int N) {
ll mn,mx;
MinMax(0,(ll)1e18,&mn,&mx);
ll dif = cdiv(mx-mn,N-1);
vpl v;
while (mn <= mx) {
ll a,b;
if (mn == mx) {
a = b = mn;
} else {
MinMax(mn, mn+dif-1,&a,&b);
}
if (a != -1) v.pb({a,b});
mn += dif;
}
ll ans = dif;
F0R(i,sz(v)-1) ans = max(ans,v[i+1].f-v[i].s);
return ans;
}
long long findGap(int T, int N) {
if (T == 1) return solve1(N);
return solve2(N);
}
