This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "gap.h"
#include <algorithm>
using namespace std;
long long findGap(int T, int N)
{
long long s = 0;
long long t = 1000000000;
t*=t;
long long nax;
long long as = 0;
for(int i = 0;i<N;i++){
long long l = s;
long long r = t;
long long ans;
long long mn,mx;
MinMax(l,r,&mn,&mx);
ans = mn;
if(i){
as = max(as,ans-nax);
}
nax = ans;
s = ans+1;
}
// cout<<as<<endl;
return as;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |