Cod sursa(job #2912755)
Utilizator | Data | 10 iulie 2022 15:21:52 | |
---|---|---|---|
Problema | Progresie | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva ICPC | Marime | 0.61 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,y;
bool s,o;
int main()
{
for(F>>t;t;--t)
for(F>>n>>r,x=r*(n-1)+1,j=1;j<=x*x-x+1;j+=l*(l-1)+1-y) {
for(k=0;k<n;++k) {
y=j+k*r,l=sqrt(y);
if(y==l*l)
continue;
++l;
if(y>l*(l-1))
continue;
break;
}
if(k==n) {
G<<j<<'\n';
break;
}
}
return 0;
}