第三题:动态规划求Fibonacci数。
#include<iostream>
using namespace std;
int main()
{
int a = 1, b = 1,sum=0,n;
cout << "输入一个数:";
cin >> n;
for (int i = 1; i < n; ++i)
{
sum = a + b;
a = b;
b = sum;
}
cout << sum << endl;
return 0;
}
第三题:动态规划求Fibonacci数。
#include<iostream>
using namespace std;
int main()
{
int a = 1, b = 1,sum=0,n;
cout << "输入一个数:";
cin >> n;
for (int i = 1; i < n; ++i)
{
sum = a + b;
a = b;
b = sum;
}
cout << sum << endl;
return 0;
}