Pagini recente » Cod sursa (job #2154343) | Cod sursa (job #472840) | Cod sursa (job #1787089) | Cod sursa (job #407519) | Cod sursa (job #3310040)
#include<fstream>
#include<cmath>
using namespace std;
ifstream cin("progresie.in");
ofstream cout("progresie.out");
int main()
{
short t;
for(cin>>t;t--;) {
short n;
int r;
cin>>n>>r;
long long k=1LL*(r*n-r+1)*(r*n-r+1)-r*n+r;
bool f=1;
for(long long i=1;i<k&&f;) {
long long x=0,y=i+1LL*r*n-r;
for(long long l=i;l<=y&&!x;l+=r) {
int q=(int)sqrt(l);
if(1LL*q*q!=l&&1LL*(q+1)*(q+1)-q>l)
x=1LL*(q+1)*(q+1)-q-l;
}
if(!x)
cout<<i<<'\n',f=0;
else
i+=x;
}
if(f)
cout<<k<<'\n';
}
return 0;
}