Cod sursa(job #2912594)
| Utilizator | Data | 9 iulie 2022 13:22:53 | |
|---|---|---|---|
| Problema | Progresie | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva ICPC | Marime | 0.47 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("progresie.in");
ofstream G("progresie.out");
int t;
long long n,r,x,l,j,k,i;
bool s,o;
int main()
{
for(F>>t;t;--t)
for(F>>n>>r,x=1LL*r*(n-1)+1,s=0,i=1;i<=x&&!s;++i) {
for(j=1LL*i*i-i+1,l=i-1,o=1,k=1;k<=n&&o;++k,j+=r)
l=sqrt(j),l=1+(long long)(l),o=(j==1LL*(l-1)*(l-1)||j>1LL*l*l-l);
if(o)
s=1,G<<i*i-i+1<<'\n';
}
return 0;
}
