编程求fibonacci数列

PrivateSubForm_Click()Dima(1To40)AsLongFori=1To40Ifi=1Ori=2Thena(i)=1Elsea(i)=a(i-2)+a(i-1)EndIfPrin

#includeintFibonacci(intn){if(n==0)return1;elseif(n==1)return1;elsereturnFibonacci(n-2)+Fibonacci(n-

#includevoidmain(){inta[40],i;a[0]=a[1]=1;for(i=2;i

PrivateSubForm_Click()DimnAsIntegern=Val(InputBox("请输入N:"))Dima,bAsLonga=1:b=1Fori=1TonPrinta&""&b&"

#include#include#includeusingnamespacestd;#defineM100inta[M];voidmain(){inti,j;a[0]=1;a[1]=2;i=1;

OptionExplicitDimf(40)AsLongPrivateSubCommand1_Click()DimiAsByteDimsAsLongf(1)=1f(2)=1s=2Print"No1:"

inta[101],i;a[0]=0,a[1]=1;floatt;for(i=2;i

#include#defineCOL10//一行输出10个longscan(){//输入求fibonacci函数的第N项intn;printf("InputtheN=");scanf("%d",&n)

非递归：staticvoidf(intn){longp1=1,p2=1,p=1;for(inti=1;i

大于4000的最小项41815000之内的项数01123581321345589144233377610987159725844181Pressanykeytocontinue

写一函数intFibonacci(intn){if(n==1||n==2){return1;}returnFibonacci(n-1)+Fibonacci(n-2);}

在另一个帖子回答了

Private Sub Form_Load()Dim I As IntegerForm1.AutoRedraw = TrueFor

#!/bin/bash#fibo.sh:Fibonaccisequence(recursive)#Author:M.Cooper#License:GPL3######----------algorit

我给你代码：#include <stdio.h>#include <stdlib.h>#define N 47int fibo

#includeintFib(intm){if(m==1||m==2)return1;returnFib(m-1)+Fib(m-2);}voidmain(){intn,i;printf("请输入n的值

publicclassFibonacci1{publicstaticlongfib(intn){longf1=1,f2=1;longm=0;if(n

#includeusingnamespacestd;intmain(){\x09inta[1000001];\x09intn,i;\x09a[1]=a[2]=1;\x09cin>>n;\x09for(

#include<stdio.h>void main(){    int m;    w

下面的程序可以修改宏定义N的值来确定输出的数的个数#include#defineN30voidmain(){unsignedlonginta[N];inti,j;a[0]=1;a[1]=1;for(i