互相学习,有好的建议欢迎提出
#includeint fib( int n ); void PrintFN( int m, int n ); int main() { int m, n, t; scanf("%d %d %d", &m, &n, &t); printf("fib(%d) = %dn", t, fib(t)); PrintFN(m, n); return 0; } int fib(int n) { int i = 2, a = 1, b = 1, c = 0; if (n <= i) { return 1; } else { for (i = 2; i < n; i++) { c = a + b; a = b; b = c; } } return c; } void PrintFN(int m, int n) { int i = 1; int count = 0; while (fib(i) <= n) { if (fib(i) >= m) count++ ; if (count == 1) printf("%d", fib(i)); else if(count>1) printf(" %d", fib(i)); i++; } if (count == 0) printf("No Fibonacci number"); }



