백준 알고리즘 1003번

평범한 재귀함수이다

import java.util.Scanner; public class Main { static int n1 =0; static int n2 =0; static int fibonacci(int n){ if(n==0){ n1++; return 0; }else if(n==1){ n2++; return 1; }else{ return fibonacci(n-1)+fibonacci(n-2); } } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int select = sc.nextInt(); int i=0; while(i<select){ fibonacci(sc.nextInt()); System.out.println(n1+" "+n2); n1=0; n2=0; i++; } sc.close(); } }