#include <bits/stdc++.h>
using namespace std;
#include "gap.h"
long long solve1(int n) {
set<long long> s;
long long l = 0, h = 1e18;
while (s.size() != n) {
long long mn = -1, mx = -1;
MinMax(l, h, &mn, &mx);
l = mn + 1, h = mx - 1;
s.insert(mn);
s.insert(mx);
}
long long last = 1e18, ans = 0;
for (auto i : s) {
ans = max(ans, i - last);
last = i;
}
return ans;
}
long long solve2(int n) {
long long mn = -1, mx = -1, l = 0, h = 1e18, tm1 = -1, tm2 = -1;
MinMax(l, h, &mn, &mx);
if (n == 2)
return mx - mn;
long long m = (mx - mn) / (n - 1), last = mn, ans = m;
for (long long i = mn; i < mx; i += m + 1) {
MinMax(i, i + m, &tm1, &tm2);
ans = max(ans, tm1 - last);
last = max(last, tm2);
}
return ans;
}
long long findGap(int t, int n) {
if (t == 1)
return solve1(n);
else
return solve2(n);
}
