Pagini recente » Cod sursa (job #2109475) | Cod sursa (job #1954094) | Cod sursa (job #207198) | Cod sursa (job #696472) | Cod sursa (job #2053431)
#include <bits/stdc++.h>
#define MaxN 100005
#define MOD 666013
#define INF 2140000000
using namespace std;
FILE*IN,*OUT;
int T,N,R;
long long upper(long long val)
{
long long lw=1,hi=INF,mid,last=1;
while(lw<=hi)
{
mid=(lw+hi)>>1;
if(mid*(mid-1)+1<=val)
last=mid,lw=mid+1;
else hi=mid-1;
}
if(last*last>=val)
return val;
else return last*(last+1)+1;
}
long long lower(long long val)
{
long long lw=1,hi=INF,mid,last=1;
while(lw<=hi)
{
mid=(lw+hi)>>1;
if(mid*mid>=val)
last=mid,hi=mid-1;
else lw=mid+1;
}
if(val>=last*(last-1)+1)
return val;
else return (last-1)*(last-1);
}
int main()
{
IN=fopen("progresie.in","r");
OUT=fopen("progresie.out","w");
fscanf(IN,"%d",&T);
for(int t=1;t<=T;t++)
{
fscanf(IN,"%d%d",&N,&R);
for(int i=1;;i++)
{
long long start=i*(i-1)+1,end=i*i;
bool p=1;
for(int j=1;j<N;j++)
{
long long nstart=start+R,nend=end+R;
start=upper(nstart);
end=lower(nend);
if(end<start)
{
p=0;
break;
}
}
if(p)
{
fprintf(OUT,"%d\n",start-1LL*R*(N-1));
break;
}
}
}
return 0;
}