[WikiOI] 2.5.2 Fibonacci数列

[Problem]

斐波纳契数列是这样的数列：

f₁ = 1

f₂ = 1

f₃ = 2

f₄ = 3

....

f_n = f_n-1 + f_n-2

 

输入一个整数n

求f_n

[Solution]

#include <iostream>
using namespace std;

int main(){
    int array[41];
    array[1] = 1;
    array[2] = 1;
    int n;
    cin >> n;
    for(int i = 3; i <= n; ++i){
        array[i] = array[i-1] + array[i-2];
    }
    cout << array[n] << endl;
    return 0;
}