Pagini recente » Cod sursa (job #2056338) | Cod sursa (job #2252842) | Cod sursa (job #13101) | Cod sursa (job #1395806) | Cod sursa (job #2760567)
#include <bits/stdc++.h>
using namespace std;
ifstream in("progresie.in");
ofstream out("progresie.out");
typedef long long ll;
ll tst,n,r;
bool inside(ll x) {
ll rad=sqrt(x);
if(x==rad*rad)
return true;
++rad;
return ((rad-1)*rad+1<=x and x<=rad*rad);
}
void solve() {
for(ll k=1;; ++k){
//for(ll i=k*(k-1)+1; i<=k*k; ++i) {
ll i=k*(k-1)+1;
ll j;
for(j=1; j<n; ++j)
if(!inside(i+j*r))
break;
if(j==n) {
out<<i<<'\n';
return ;
}
//}
}
}
int main() {
in>>tst;
while(tst--) {
in>>n>>r;
solve();
}
return 0;
}