斐波那契级数≥﹏≤≥﹏≤

#include <stdio.h>
int n;
int fib(int k)
{
  if(k==1)
    return 1;
  return fib(k-1) + fib(k-2);
}
int main()
{
  scanf("%d",&n);
  printf("%d\n",fib(n));
  return 0;
}

#include <stdio.h>

int main()
{
    int t1 = 0, t2 = 1, nextTerm = 0, n;

    printf("输入一个正数: ");
    scanf("%d", &n);

    // 显示前两项
    printf("斐波那契数列: %d, %d, ", t1, t2);

    nextTerm = t1 + t2;

    while(nextTerm <= n)
    {
        printf("%d, ",nextTerm);
        t1 = t2;
        t2 = nextTerm;
        nextTerm = t1 + t2;
    }

    return 0;
}