Pagini recente » Cod sursa (job #3322979) | Cod sursa (job #3215474) | Monitorul de evaluare | Cod sursa (job #2436448) | Cod sursa (job #3310041)
#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;
bool o=1;
for(long long i=1;o;) {
long long v=i*(i-1)+1,e=i-1,l=0,x=0;
int j=1;
for(;j<n;++j) {
long long l=v+1LL*j*r,q=sqrt(l);
if(1LL*q*q!=l&&1LL*(q+1)*(q+1)-q>l)
break;
}
j==n?cout<<v<<'\n',o=0:++i;
}
}
return 0;
}