Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int Fib(int n) {
- if (n == 0 || n == 1) {
- return 1;
- }
- int fib_prev = 1;
- int fib_cur = 1;
- int fib_next = fib_prev + fib_cur;
- for (int i = 2; i <= n; ++i) {
- fib_next = fib_prev + fib_cur;
- fib_prev = fib_cur;
- fib_cur = fib_next;
- }
- return fib_next;
- }
- int main() {
- int n;
- cin >> n;
- cout << Fib(n) << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement