// Fibonacciho posloupnost s použitímm rekurze

#include <iostream>

using namespace std;

int fib (int n);



int main()

{



	int n, FibonacciNumber;

	cout << "  Vlozte poradi (do 23) v posloupnosti: ";

	cin >> n;



	cout << "\n\n";



	FibonacciNumber = fib(n);



	cout <<endl<< "  Fib("<<n << ") = "<<FibonacciNumber;

	cout << "  Fibonacciho cislo je " << FibonacciNumber << "\n";

	return 0;

}



int fib (int n)

{

	cout << "  Zpracovani fib(" << n << ")... ";



	if (n < 2 )

	{ if (n==0) {cout<<0; return(0);}

		         else  {cout <<1; return(1);}

	}

	else

	{

		cout << "  Volani fib(" << n-2 << ") ";

		cout << "a fib(" << n-1 << ").\n";

		return( fib(n-2) + fib(n-1));

	}

}