/*
下列为,求斐波那契数列的前n项和;
输入示例:
5
10
输出示例:
12
*/
#include
using namespace std;
int feibonaqie(int n) //递归循环体用于计算每个斐波那契数列的值
{
if(n == 1 || n == 2) return 1;
else return feibonaqie(n - 1) + feibonaqie(n - 2);
}
int main()
{
int n,sum = 0;
cout << “请输入你要求的数” << endl;
cin >> n;
for(int i = 1;i <= n;i++) //用for循环算所有数列的和
{
sum = sum + feibonaqie(i);
}
cout << sum << endl;
return 0;
}