/*
4.8 用递归方法编程计算以下式子的值:
n^1+n^2+n^3+n^4+...+n^10,其中 n=1,2,3
*/
#include <iostream>
using namespace std;
int cifang(int n, int k)
{
int he = 1;
int sum = 0;
if (k <=1)
{
}
else
{
sum = cifang(n, k - 1);
}
while (k)
{
he*= n;
k--;
}
sum += he;
return sum;
}
void calcc(int n)
{
int k = 10;
int sum = 0;
int m = 1;
for (int i = 1; i <= 10; i++)
{
int j = i;
while (j)
{
m *= n;
j--;
}
sum += m;
}
//cout << "sum=" << sum << endl;
}
void main()
{
int sum=cifang(1, 10);
cout << "sum=" << sum << endl;
system("pause");
}
4.8 用递归方法编程计算以下式子的值:
n^1+n^2+n^3+n^4+...+n^10,其中 n=1,2,3
*/
#include <iostream>
using namespace std;
int cifang(int n, int k)
{
int he = 1;
int sum = 0;
if (k <=1)
{
}
else
{
sum = cifang(n, k - 1);
}
while (k)
{
he*= n;
k--;
}
sum += he;
return sum;
}
void calcc(int n)
{
int k = 10;
int sum = 0;
int m = 1;
for (int i = 1; i <= 10; i++)
{
int j = i;
while (j)
{
m *= n;
j--;
}
sum += m;
}
//cout << "sum=" << sum << endl;
}
void main()
{
int sum=cifang(1, 10);
cout << "sum=" << sum << endl;
system("pause");
}