HDOJ 2041超级楼梯

杭电oj2041超级楼梯原题链接

题目描述：

思路：找规律，斐波那契数列，f(n) = f(n-1) + f(n-2)

AC代码：

#include <iostream>
using namespace std;
const int M = 45;
long long arr[M];
int main()
{
    int N, m;
    cin >> N;
    arr[2] = 1;
    arr[3] = 2;
    arr[4] = 3;
    for(int i = 5; i <= M; i++)
    {
        arr[i] = arr[i-1] + arr[i-2];
    }
    while(N--)
    {
        cin >> m;
        cout << arr[m] << endl;
    }
    return 0;
}