[Java] BOJ 1904번 01타일

1904번: 01타일

---

풀이

점화식인 memo[i] = memo[i - 1] + memo[i - 2]를 사용해서 해결했습니다.

---

코드

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	public final static int mod = 15746;
	public static int N;
	public static int[] memo = new int[1000001];
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		N = Integer.parseInt(br.readLine());
		
		memo[1] = 1;
		memo[2] = 2;
		for (int i = 3; i <= N; ++i) {
			memo[i] = memo[i - 1] + memo[i - 2];
			memo[i] %= mod;
		}
		
		System.out.println(memo[N] % mod);
	}
}

---

pyo7410/Algorithm