斐波那契数列

#include <stdio.h>int fib(int n){if (n == 1 ){return 0;}else if (n == 2){return 1;}else {return fib(n-1)+fib(n-2);}}int fib1(int n){int a=0,b=1;int c;if (n == 1 ){                return 0;        }        else if (n == 2){                return 1;        }else{for(int i=3;i<=n;i++){c=a+b;a=b;b=c;}return c;}}int main(){ int n;printf("请输入一个正整数:");scanf("%d",&n);//for(n=1;n<100;n++){printf("f(%d)-->%d\n",n,fib1(n));printf("f(%d)-->%d\n",n,fib(n));//递归算法求解。//}return 0 ;}