[백준] 10870번 / 피보나치 수 5

#include <iostream>

int fibonacci(int n){
	if(n < 2)
		return n;
	else
		return fibonacci(n-1) + fibonacci(n-2);
}

int main(){
	int N = 0;
	int answer = 0;
	scanf("%d", &N);
	
	for(int i=0; i<N+1; i++)
		answer = fibonacci(i);

	printf("%d", answer);
	return 0;
}

2017/09/18 - [Doing/C&C++] - 피보나치(반복, 재귀)