#include<iostream>
using namespace std;
int fib(int n){
//返回第n项Fibonacci数
if (n == 1 || n == 2)
return 1;
else return fib(n-1) + fib(n-2);
}
void PrintFN(int m, int n ){
int flag = 0, k = 1;
while(fib(k) < m)
k++; //找到第一项大于等于m的Fibonacci数
if(fib(k) <= n){
cout << fib(k); //符合要求则输出,分开是为了行末无多余空格
flag = 1;
}
while(fib(++k) <= n)
cout << " " << fib(k); //检查剩余区间
if(!flag)
cout << "No Fibonacci number";
}
int main(){
int m, n, t;
cin >> m >> n >> t;
cout << fib(t) << endl;
PrintFN(m, n);
return 0;
}
我的代码#include<iostream>using namespace std;int fib(int n){ //返回第n项Fibonacci数 if (n == 1 || n == 2) return 1; else return fib(n-1) + fib(n-2);}void PrintFN(int m, int n ){ int flag = 0, k = 1; while(fib(k) < m) k++; //找到第一项大于等...