[BOJ] 11726 2×n 타일링

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
 
using namespace std;

int main() {
    int n;
    int dp[1000] = {};
    scanf("%d", &n);

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

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

    printf("%d", dp[n]);

    return 0;
}