// Fibonacciho posloupnost bez rekurze

#include <iostream>

using namespace std;



int fib( int n);





int main()

{



	int n, odpoved;

	cout << "  Vlozte poradi v posloupnosti: ";

	cin >> n;

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

	cout << "\n\n";



	odpoved = fib(n);



	cout << "  Fib("<<n << ") = "<<odpoved;

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

	return 0;

}

 int fib( int n)

{int i,a,b,c;

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





	else

	{i=1; a=1; b=0; c=0;

                    while (i<n)  {

                                 i++; c=b; b=a; a=b+c;

                                cout<<"  "<< a << endl;

                                 }

                 return(a);

	}





}