斐波那契数列

#include <iostream>
using namespace std;

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