Q11727. 2×n 타일링 2

코딩/백준 알고리즘

금손형아 2019. 2. 9. 22:22

이와 유사한 문제 2 x n 타일링 문제가 있었죠?

import java.io.BufferedReader;

import java.io.InputStreamReader;

import java.util.StringTokenizer;

public class Q11727 {

static long[] array;

public static void main(String[] args) throws Exception {

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

StringTokenizer st = new StringTokenizer(br.readLine());

int targetNum = Integer.valueOf(st.nextToken());

array = new long[1001];

array[1] = 1;

array[2] = 3;

for (int i = 3; i <= targetNum; i++) {

array[i] = (array[i-2]*2 + array[i-1]) % 10007;

}

System.out.println(array[targetNum] % 10007);

}