[BAE/<JOON> 문제풀이] 11727. 2×n 타일링 2 (DP.011)

https://www.acmicpc.net/problem/11727

11727번: 2×n 타일링 2

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> arr;
    arr.resize(n + 1);
    arr[1] = 1;
    for (int i = 2; i <= n; i++) {
        if (i % 2 == 0) {
            arr[i] = (arr[i - 1] * 2 + 1) % 10007;
        }
        else {
            arr[i] = (arr[i - 1] * 2 - 1) % 10007;
        }
    }
    
    cout << arr[n] << endl;
}