1 . 求菲波那契数列的前 n 项
Fibonacci 数列:0,1,1,2,3,5,8,13,21,34,……
f0 = 0
f1 = 1
fn = fn-1 + fn-2 ( n >= 2 )
分析 可以用迭代方法求解
为了得到当前项,要使用前两项,所以用两个变量迭代
#include <iostream>
using namespace std ;
int main(){
int n, i, a0, a1 ;
cout << "n = " ;
cin >> n ;
a0 = 0 ; a1 = 1 ;
cout << a0 << " "<< a1 << " ";
for ( i = 2; i <= n/2 ; i ++ ){
a0 = a0 + a1 ;
a1 = a1 + a0 ;
cout << a0 << " "<< a1 << " ";
if ( i % 5 == 0 ) cout << endl ;
}
if ( n > (i-1)*2 ) cout << a0+a1 << endl ;
return 0;
}