斐波那契数列**1. 自顶向下递归#include <iostream> using namespace std; int fib(int m) { if (m <= 1) return m; else if (m> 1) return fib(m - 1) + fib(m- 2); } int main() { int n; cin >> n; int i = 0; for (; i <= n; i++) { cout << fib <<