Pagini recente » Cod sursa (job #783471) | Cod sursa (job #2883345) | Cod sursa (job #3317867) | Borderou de evaluare (job #1530411) | Cod sursa (job #3310052)
#include<fstream>
#include<cmath>
using namespace std;
ifstream cin("progresie.in");
ofstream cout("progresie.out");
int main()
{
short t;
for(cin>>t;t--;) {
short n;
int i=1,r;
cin>>n>>r;
for(bool o=1;o;) {
int j=1;
long long v=1LL*i*i-i+1;
for(long long e=i-1;j<n;++j) {
long long l=v+1LL*j*r;
int b=sqrt(l-1)+1;
long long y=1LL*b*b,x=y-b+1;
if(l<x?v+=x-l,e+=l-x:e=min(e,y-l),l+e<x)
break;
}
j==n?cout<<v<<'\n',o=0:++i;
}
}
return 0;
}