Pagini recente » Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #2053460)
#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 r=sqrt(val-1)+1;
return max(r*(r-1)+1,val);
}
long long lower(long long val)
{
long long r=sqrt(val-1)+1;
if(r*(r-1)+1<=val)
return val;
else return (r-1)*(r-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(long long i=1;;i++)
{
long long start=i*(i-1)+1,end=i*i;
bool p=1;
for(int j=1;j<N;j++)
{
start=upper(start+R),end=lower(end+R);
if(end<start)
{
p=0;
break;
}
}
if(p)
{
fprintf(OUT,"%lld\n",start-1LL*R*(N-1));
break;
}
}
}
return 0;
}