[백준 1904] 01타일 - JAVA

https://www.acmicpc.net/problem/1904

 

dp

 

import java.util.Scanner;

class Main {

  public static void main(String[] args) {

    int N = new Scanner(System.in).nextInt();
    int MOD = 15746;
    int[][] dp = new int[N + 1][2];

//    dp[0][0] = 0;
//    dp[0][1] = 0;
//    dp[1][0] = 0;

    dp[1][1] = 1;

    if (N >= 2) {
      dp[2][1] = 1;
      dp[2][0] = 1;
    }

    for (int i = 3; i <= N; i++) {
      dp[i][0] = ((dp[i - 2][0] % MOD) + (dp[i - 2][1] % MOD)) % MOD;
      dp[i][1] = ((dp[i - 1][0] % MOD) + (dp[i - 1][1] % MOD)) % MOD;
    }

    System.out.println((dp[N][0] + dp[N][1]) % MOD);
  }
}