24416_알고리즘_수업-피보나치_수_1.cpp

#include <bits/stdc++.h>
using namespace std;

int N, cnt1=0, cnt2=0;

int fib(int n) {
    if (n == 1 || n == 2){
        cnt1++;
        return 1;
    }
    else return (fib(n - 1) + fib(n - 2));
}

int fibonacci(int n) {
    int f[n];

    f[1] = 1;
    f[2] = 1;
    for (int i=3; i<=n; i++) {
        cnt2++;
        f[i] = f[i - 1] + f[i - 2];  
    }
    return f[n];
}

int main(void) {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> N;
    fib(N);
    fibonacci(N);

    cout << cnt1 << " " << cnt2 << endl;
}