[Algorithm] BOJ 10870 - 피보나치수 5
int solution(int inputData){
int result = 0;
result = getResult(inputData);
return result;
}
int getResult(int num){
if (num > 1) {
return getResult(num-1) + getResult(num-2);
} else if(num == 1){
return 1;
} else
return 0;
}