Pagini recente » Cod sursa (job #2526978) | Cod sursa (job #812763) | Cod sursa (job #1338663) | Cod sursa (job #378165) | Cod sursa (job #1358123)
#include <iostream>
#include<stdio.h>
#include<cmath>
using namespace std;
FILE *f,*g;
int main()
{
int i,j,n,t,r,u,s,t1;
bool ok,ok1;
f=fopen("progresie.in","r");
g=fopen("progresie.out","w");
fscanf(f,"%lld",&t);
for(i=1;i<=t;i++)
{
fscanf(f,"%d %d",&n,&r);
for(j=1;j<=10000000;j++)
{
if((j>=(trunc(sqrt(j))+1)*trunc(sqrt(j))+1 &&
j<=(trunc(sqrt(j))+1)*(trunc(sqrt(j))+1)) || sqrt(j)==trunc(sqrt(j)))
{
t1=j;
ok=true;
for(u=1;u<n;u++)
{
ok1=true;
t1=t1+r;
if(sqrt(t1)==trunc(sqrt(t1))) ok1=false;
if(ok1==true)
{if((t1>=(trunc(sqrt(t1))+1)*trunc(sqrt(t1))+1 &&
j<=(trunc(sqrt(t1))+1)*(trunc(sqrt(t1))+1))) s++; else {ok=false;
break;}}
}
}
if(ok==true) break;
}
fprintf(g,"%d\n",j);
}
fclose(f);
fclose(g);
return 0;
}