2xn타일링(백준)

#include <string>
#include <vector>
#include <iostream>

using namespace std;



int main()
{
	int N;
	cin >> N;
	int DP[1001] = { 0, };
	DP[1] = 1;
	DP[2] = 2;
	
	for (int i = 3; i <= N; i++)
	{
		DP[i] = (DP[i - 1] + DP[i - 2])%10007;
	}

	cout << DP[N];

	return 0;

}

이문제 풀었음