#include "gap.h"
#include <algorithm>
#include <iostream>
using namespace std;
const long long MIN = 0;
const long long MAX = 1'000'000'000'000'000'000;
long long findGap(int T, int N)
{
long long mn, mx;
MinMax(MIN, MAX, &mn, &mx);
long long diff = (mx-mn+1 + N-2)/(N-1), sol = 0, prev_mx = MAX, st = mn;
while (st <= mx) {
long long en = min(MAX, st+diff-1), cur_mn, cur_mx;
MinMax(st, en, &cur_mn, &cur_mx);
if (cur_mn != -1) {
sol = max(sol, cur_mn - prev_mx);
prev_mx = cur_mx;
}
st += diff;
}
return sol;
}
