[1003번] 피보나치 수열

다이나믹 프로그래밍(DP) 의 기초문제

import java.util.Scanner;
 
import javax.swing.plaf.synth.SynthSeparatorUI;
 
public class Main {
    static int z=0;
    static int o=0;
    static int[] a = { 0, 0 };
 
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
 
        int T = sc.nextInt();
        for (int i = 0; i < T; i++) {
            int x = sc.nextInt();
            while (x > 40 || x<0) {
                x = sc.nextInt();
            }
            fibonacci(x);
            System.out.println(z + " " + o);
            z=0;
            o=0;
        } // for end
 
    }
 
    public static int fibonacci(int n) {
        if (n == 0) {
            z++;
            return 0;
        } else if (n == 1) {
            o++;
            return 1;
        } else {
            return fibonacci(n - 1) + fibonacci(n - 2);
        }
    }
 
 
 
}