Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void beolv(int &n)
- {
- cin>>n;
- }
- void kiir(int n)
- {
- cout<<n;
- }
- int fib(int n)
- {
- int f1=0,f2=1,i,ossz=0;
- if (n<1)
- return 0;
- for (i=0;i<n;i++)
- {
- ossz=ossz+f2;
- f2=f2+f1;
- f1=f2-f1;
- }
- return ossz;
- }
- int main()
- {
- int n;
- beolv(n);
- kiir(fib(n));
- return 0;
- }
Add Comment
Please, Sign In to add comment