[백준 Java] BOJ 11726 2xn 타일링 Java 문제 풀이

11726번: 2×n 타일링 (acmicpc.net)

11726번: 2×n 타일링

import java.io.*;
import java.util.*;

public class Main {
  static int[] dp;
  public static int answer(int n){
    dp = new int[n];
    for (int i=0;i<n;i++){
      if (i==0){
        dp[i] = 1;
      } else if (i==1){
        dp[i] = 2;
      } else {
        dp[i] = (dp[i-1]+dp[i-2]>10007)?(dp[i-1]+dp[i-2]%10007):dp[i-1]+dp[i-2];
      }
    }
    return dp[n-1]%10007;
  }
  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int n = Integer.parseInt(br.readLine());
    System.out.println(answer(n));
  }
}