[백준] 11727 2×n 타일링 2 c++

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

11727번: 2×n 타일링 2

#include<iostream>

using namespace std;

int main()
{
	int n;
	int dp[1001];
	cin >> n;
	dp[0] = 0;
	dp[1] = 1;
	dp[2]=3;
	for (int i = 3; i <= n; i++)
	{
		if (i % 2)//홀수면
			dp[i] = (dp[i - 1] + dp[i - 2]*2) % 10007;
		else//짝수면
			dp[i] = (dp[i - 2] * 3+ dp[i-3]*2) % 10007;
		
	}
	cout << dp[n];

}