题目:一只青蛙一次可以跳上1 级台阶,也可以跳上2级。求该青蛙跳上一个n级台阶共有多少种跳法。
#include <exception>
#include <iostream>
using namespace std;
long long Fibonacci(unsigned n) {
if (n == 0)
return 0;
if (n == 1)
return 1;
long long fn1 = 1;
long long fn2 = 0;
long long fn;
for (int i = 2; i <= n; i++) {
fn = fn1 + fn2;
fn1 = fn;
fn2 = fn1;
}
return fn;
}
int main() {
unsigned n = 60;
long long result = Fibonacci(n);
cout << result << endl;
return 0;
}