재귀함수를 이용한 fibonacci

/* made by hahahia */

 

#include <iostream>

 

using namespace std;

int count;

int fibonacci(int num1, int num2)

{

 cout << " " << num1+num2 ;

 count--;

 if(count==0)

  return 0;

 else

  fibonacci(num2, num1+num2);

}

 

void main()

{

 cin >> count;

 cout << "0 1" ;

 count = count - 2;

 fibonacci(0,1);

 cout << endl;

}