Q11726. 2 x n 타일링

피보나치와 같은 로직입니다.

K(n) = K(n-2) + K(n-1)입니다.

import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Q11726 { static int[] array = new int[1001]; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int maxNum = Integer.valueOf(st.nextToken()); array[1] = 1; array[2] = 2; for (int i = 3; i <= maxNum; i++) { array[i] = (array[i-2] + array[i-1]) % 10007; } System.out.println(array[maxNum]); } }