Pagini recente » Cod sursa (job #740560) | Cod sursa (job #3146584) | Cod sursa (job #2217140) | Cod sursa (job #2667133) | Cod sursa (job #1358730)
#include<fstream>
#include<cmath>
using namespace std;
int main()
{
long long i,j,n,t,r,u,t1,k;
double h;
bool ok;
ifstream f("progresie.in");
ofstream g("progresie.out");
f>>t;
for(i=1;i<=t;i++)
{
f>>n>>r;
for(k=1;k<=1000000;k++)
{
for(j=k*(k-1)+1;j<=k*k;j++)
{
t1=j;
ok=true;
for(u=1;u<n;u++)
{
t1=t1+r;
h=sqrt(t1);
if (h!=trunc(h))
if((t1<(trunc(h)+1)*trunc(h)+1 || t1>(trunc(h)+1)*(trunc(h)+1))) {ok=false; break;}
}
if(ok==true) break;
}
if(ok==true) {g<<j<<'\n'; break;}
}
}
f.close();
g.close();
return 0;
}