본문 바로가기
백준

백준 동적계획법 - 1904번 : 01타일

by 맴썰 2022. 2. 16.

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


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


public class Main {
		public static int[] memo = new int[1000001];
	public static void main(String[] args) throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		st = new StringTokenizer(br.readLine());
		int a = Integer.parseInt(st.nextToken());
		memo[1] = 1;
		memo[2] = 2;
		System.out.println(func(a));
	}
	static int func(int a) {
		for(int i=3; i<=a; i++) {
			memo[i] = (memo[i-2]+memo[i-1])%15746;
		}
		return memo[a];
	}
}

Bottom-up으로 했더니 통과되었다.