백준, 이친수, 2193, 다이나믹 프로그래밍

Problem2193.java

import java.util.Scanner;

public class Problem2193 {

	public static long[][] dp;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		sc.close();

		dp = new long[N + 1][2];
		dp[1][0] = 0;
		dp[1][1] = 1;

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

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