[BOJ] 15624 피보나치 수 7

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int main() {
    int n;
    int dp[1000000] = {};
    cin >> n;

    dp[0] = 0;
    dp[1] = 1;
    dp[2] = 1;

    for (int i=3; i <= n ; i++) {
        dp[i] = (dp[i-1] + dp[i-2]) % 1000000007;
    }

    cout << dp[n];

    return 0;
}