[알고리즘] 이친수, 백준 2193

package dp;
import java.util.Scanner;

public class backjoon_2193 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        long[] d = new long[N+1];

        d[1] = 1;

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

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

        System.out.println(d[N]);

    }
}

 

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

불러오는 중입니다...