迭代法  #include <iostream> using namespace std; int main() { // F0 = 0 int a = 0; // F1 = 1 int b = 1; int n; // current 为 Fn对应的值，初始为F0，即a int current = a; cin >> n; // 开始迭代 for (int i = 0; i < n; i++) { // cu...

#include<iostream> using namespace std; int Fibonacci(int n){ if(n == 0) return 0; else if(n == 1) return 1; else return Fibonacci(n - 1) + Fibonacci(n - 2); } int main(){ int n; while(scanf("%d", &n) != EOF){ printf("%d\n", Fibonacci(n)); ...