BOJ
[BOJ/C++/11728] 2 x n 타일링
#include using namespace std; int chk[1001]; int solve(int n){ if(n==1) return 1; else if(n==2) return 2; else if(chk[n]>0) return chk[n]; chk[n]=(solve(n-1)+solve(n-2))%10007; return chk[n]; } int main(){ int n; scanf("%d",&n); printf("%d",solve(n)); return 0; }
