递推公式:
n(m) = n(m-1) + 6*(m-1)
#include <iostream>
using namespace std;
int sum = 0;
int a(int m){
if(m == 1)
return 2;
else
return a(m-1) + 6*(m-1);
}
int main(){
int m;
cin>>m;
cout<<a(m)<<endl;
return 0;
}
递推公式:
n(m) = n(m-1) + 6*(m-1)
#include <iostream>
using namespace std;
int sum = 0;
int a(int m){
if(m == 1)
return 2;
else
return a(m-1) + 6*(m-1);
}
int main(){
int m;
cin>>m;
cout<<a(m)<<endl;
return 0;
}