[JAVA/백준] SW 역량 테스트 준비-기초 | 다이나믹 프로그래밍: 2×n 타일링 2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
import java.util.Scanner;

/**
 * @author HEESOO
 *
 */
public class Main {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int n=scan.nextInt();
		int[] dp=new int[n+1];
		
		for(int i=1;i<=n;i++) {
			if(i==1) dp[i]=1;
			else if(i==2) dp[i]=3;
			else dp[i]=dp[i-1]+2*dp[i-2];
			dp[i]%=10007;
		}
		
		System.out.println(dp[n]);
	}
}