用c语言写斐波那契数列,C语言斐波那契数列

1 , C语言斐波那契数列#include <stdio.h>int fibo(int);main() int i; for(i=1;i<=30;i++)printf("%d\t",fibo(i)); if(i%5==0) printf("\n"); }}int fibo(int n) if(n==1 || n==2)return 1; } elsereturn fibo(n-1)+fibo(n-2); }}
2,斐波那契数列 c语言#include <stdio.h>int fn(int a) if (a==1)return 1; elseif (a==2)return 2; elsereturn fn(a-1)+fn(a-2); }}void main () int i; FILE *fp; fp=fopen("e:\\jieguo.txt","w"); // 保存的路径,可以该 。for (i=1;i<=50;i++) fprintf(fp,"%d:%d\n",i,fn(i)); fclose(fp);}注意: 程序运行的有点慢,要等一会儿, 你可以把 50改成 10,就能看见运行的结果了在E盘的jieguo.txt中 。【用c语言写斐波那契数列,C语言斐波那契数列】
3,c语言编程斐波那契数列*程序说明与注释 #include&lt;stdio.h&gt; int main() int n,i,un1,un2,un; for(n=2;n&lt;3;) printf("Please enter required number of generation:"); scanf("%d",&amp;n); if(n&lt;3) printf("\n Enter error!\n"); /*控制输入正确的N值*/ } un=un2=1; printf("The repid increase of rabbits in first %d generation is as felow:\n",n); printf("l\tl\t"); for(i=3;i&lt;=n;i++) un1=un2; un2=un; un=un1+un2; /*利用通项公式求解N项的值*/ printf(i%10?"%d\t":"%d\n",un); } printf("\n"); }你可以来看下下面的网站 http://www.kuqin.com/tiku/20080424/7617.html
4,C语言 斐波那契数列怎么写123456789101112131415161718192021222324252627282930313233343536373839 #include<stdio.h>intfei(intindex) //数组实现 if(index<1) return-1; } if(index<3) return1; } int*a=newint[index]; a[0]=a[1]=1; for(inti=2; i<index; i++) a[i]=a[i-1]+a[i-2]; intm=a[index-1]; deletea; //释放内存空间 returnm;}inttou(inti) //取第一位 while(i>9) i/=10; returni;}intmain() intn,a[100]; scanf("%d",&n); for(inti=0; i<n; i++) scanf("%d",&a[i]); for(inti=0; i<n; i++) if(fei(a[i])>9) printf("%d %d\n",tou(fei(a[i])),fei(a[i])%10); else printf("%d\n",fei(a[i])); }}# include <stdio.h>int main (void)int a, b, c, d, n;printf("请输入您需要查找的序列号:"); scanf("%d", &n);// n 为要查找的序列; d 用来循环计次; c 用来求n项的值; a = 0;//第零列 b = 1;//第一列 if (n == 1) printf("序列号1值为: 1\n");else if (n == 2) printf("序列号2值为: 1\n");elsefor (d=2; d<n+1; ++d) c = a + b;a = b;b = c;}printf("序列号%d值为: %d\n", n, c);}return 0;}#include int fib(int n)//递归函数 { //斐波那契数列算法 if(n==1||n==2) return 1; return fib(n-1)+fib(n-2); } int main() { int n; scanf("%d",&n); printf("%d\n",fib(n)); return 0; }

    推荐阅读