Pagini recente » Cod sursa (job #1952598) | Cod sursa (job #3163743) | Cod sursa (job #2216613) | Cod sursa (job #2623890) | Cod sursa (job #1056664)
#include <iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
FILE *f,*g;
int bun(int t)
{
if ((t=floor(sqrt(t))*floor(sqrt(t))) or (t>=floor(sqrt(t))*floor(sqrt(t))+floor(sqrt(t))+1)) return 1;
else return 0;
}
int rezultat(int n, int r)
{
int t=0,j=1,i;
while (!j)
{
t++;
for(i=0;i<=n-1;i++)
{
if (!bun(t+i*r)) j=0;
}
return t;
}
}
int main()
{
int n,r,t,i;
f=fopen("progresie.in","r");
g=fopen("progresie.out","w");
fscanf(f,"%d\n",t);
for(i=1;i<=t;i++)
{
fscanf(f,"%d%d\n",n,r);
fprintf(g,"%d\n",rezultat(n,r));
}
fclose(f);
fclose(g);
return 0;
}