[백준 11726 : 2 x n 타일링] - C++

www.acmicpc.net/problem/11726

11726번: 2×n 타일링

#include <iostream>
#include <string.h>
using namespace std;

int dp[1001];

int find(int n)
{

	if (n == 1) return 1;
	if (n == 2) return 2;

	const int DIVIDE = 10007;

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


	return dp[n] % DIVIDE;


}

int main()
{
	int n;

	memset(dp, 0, sizeof(dp));

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

	cin >> n;

	cout << find(n) << endl;

	return 0;
}