[PS][DP]/[BOJ][11726][2*n타일링]

boj11726.cpp

#include <iostream>

using namespace std;

int n = 0;
int dp[1001] = { 0 };

int main(void) {
	int n = 0;
	cin >> n;
	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;
}