Cod sursa(job #1811949)
Utilizator | Data | 21 noiembrie 2016 18:50:47 | |
---|---|---|---|
Problema | Progresie | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva ICPC | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("progresie.in");
ofstream g("progresie.out");
int t,n,r;
int generare(int n){
if(n==1)
return 1;
return 2*(n-1)+generare(n-1);
}
int lungime(int n,int r)
{
return 1+(n-1)*r;
}
int main(){
f>>t;
int i,j,l;
for(i=1;i<=t;i++){
f>>n>>r;
l=lungime(n,r);
g<<l*(l-1)+1<<"\n";
}
return 0;
}