Pagini recente » Cod sursa (job #1326555) | Cod sursa (job #891184) | Cod sursa (job #2109455) | Cod sursa (job #1186544) | Cod sursa (job #1057526)
#include<stdio.h>
#include<vector>
#include<cstring>
#include<algorithm>
#define maxn 1005
using namespace std;
FILE*f=fopen("progresie.in","r");
FILE*g=fopen("progresie.out","w");
int n,r;
int main () {
int tests;
fscanf(f,"%d",&tests);
while ( tests-- ){
fscanf(f,"%d %d",&n,&r);
long long dif = 1LL*(n-1)*r;
long long left = 1,middle,right = 3000000000LL;
long long sol = (dif+1)*(dif+1)-dif;
while ( left <= right ){
middle = (left+right)>>1;
if ( middle*middle >= dif ){
right = middle-1;
}
else{
left = middle+1;
}
}
for ( int i = 1 ; 1LL*i*i <= r+5 && i <= sol ; ++i ){
long long now = i; int ok = 1;
for ( int j = 1 ; j < n ; ++j ){
now += r;
long long left = 1,middle,right = 3000000000LL;
while ( left <= right ){
middle = (left+right)>>1;
if ( middle*middle >= now ){
right = middle-1;
}
else{
left = middle+1;
}
}
if ( left*left - left + 1 > now ){
ok = 0;
break ;
}
}
if ( ok ){
sol = i;
break ;
}
}
fprintf(g,"%lld\n",sol);
}
fclose(f);
fclose(g);
return 0;
}