문제 링크 피보나치 수 풀이 코드 import java.util.*; public class Main { static int[] fibo; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); System.out.println(solution(n)); } private static int solution(int n) { fibo = new int[n+1]; int answer = recursive(n); return answer; } private static int recursive(int n) { if(fibo[n] != 0) return fibo[n]; if(n == 0) r..