SHOW:
|
|
- or go back to the newest paste.
| 1 | #include <iostream> | |
| 2 | using namespace std; | |
| 3 | ||
| 4 | int fibiter (int k) | |
| 5 | {
| |
| 6 | int fib, fib1, fib2; | |
| 7 | if ((k==1) || (k==2)) | |
| 8 | return 1; | |
| 9 | else | |
| 10 | {
| |
| 11 | fib1=1; | |
| 12 | fib2=1; | |
| 13 | while (k-2>0) | |
| 14 | {
| |
| 15 | fib=fib1+fib2; | |
| 16 | fib2=fib1; | |
| 17 | fib1=fib; | |
| 18 | k=k-1; | |
| 19 | } | |
| 20 | return fib; | |
| 21 | } | |
| 22 | } | |
| 23 | int main () | |
| 24 | {
| |
| 25 | int x; | |
| 26 | cout<<"Podaj numer liczby Fibonacciego: "<<endl; | |
| 27 | cin>>x; | |
| 28 | - | cout<<"Oto liczba Fibonacciego o numerze "<<x<<" : "<<fibiter(x)<<endl; |
| 28 | + | cout<<"liczba o numerze "<<x<<":"<<fibiter(x)<<endl; |
| 29 | system ("pause");
| |
| 30 | return 0; | |
| 31 | } |
