用VB做 有一个数列其前三项分别为1,2.3

floatfunction(intn){floatave,a[100],sum=0;inti;if(n==1)return1;elseif(n==2)return1.5;elseif

PrivateSubCommand1_Click()a=2b=1Dot=a/bs=s+tc=aa=a+bb=cn=n+1LoopUntiln=20PrintsEndSub再问：那我还想问下求1-1/2

斐波那契数列第100项为354224848179261915075前100项和为927372692193078999175计算结果如下：.098.135301852344706746049S098=3

#include"stdio.h"intmain(){intd1,d2,d3,t,n;d1=1;d2=2;d3=3;n=3;do{t=(d1+d2+d3)/2;d1=d2;d2=d3;d3=t;n=n

functionsum(nasinteger)dima(30)asintegerdimsasintegers=0a(1)=0a(2)=0a(3)=1fori=4to30a(i)=a(i-1)+a(i-

Dima(35)AsLongDimiAsInteger=0,jAsInteger=0Fori=0To35a(i)=Nothing'''''''''''''''''''''''''''初始化Nexta(

这种计算逻辑性、顺序性很强的.PrivateSubForm_Click()DimaAsLong,bAsLong,cAsLonga=0:b=1:c=1Printa;b;cFori=0To36Select

假设矩阵为一个数组a(1tom,1ton)SubMax()Dimb()AsSingle,maxxAsSingleFori=1Tomb(i)=a(i,1)Forj=1TonIfb(i)

我想到姜堰中学的网站上就有

OptionExplicitDimFileNameAsString'文件名变量PrivateSubForm_Load()DimFilePathAsStringFilePath=App.PathIfRi

定义9个变量a,b,c,d,e,f,g,h,i1-9分别赋给他们,共9的阶乘362880种,abcdefghi做判断a+b+c=15?d+e+f=15?...都符合abcdefghi值,输出~唉,你也

http://zhidao.baidu.com/question/84671926.htmlhttp://blog.sina.com.cn/s/blog_5f9b43970100daad.htmlht

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

PrivateSubCommand1_Click()DimS_numAsLongS_num=Val(Text1.Text)Text2.Text=""Text3.Text=""IfS_num>0Then

这一行：DoWhilex>a(p)Andp

PrivateSubCommand1_Click()Dima(30)asIntegerIfOption1.Value=TrueThena(1)=1a(2)=1Fori=3To30a(i)=a(i-1)

PrivateSubCommand1_Click()Dimi,nAsIntegerDima()AsIntegern=Val(InputBox("序列的个数","",4))IfnReDima(1Ton)

'计算按钮事件编辑框名默认Dimarr(),rd()AsInteger'定义存放数列的数组Dimi,a,b,n,sumAsIntegera=1b=1n=Val(Text1.Text)'输入求数列的项数

设第N(N>3)项数值为x,则x=（（N-1）+（N-2）+（N-3））/2,令x>1200,则（（N-1）+（N-2）+（N-3））/2〉1200,N〉802,故该数列从第803项开始,其数值超过1

递归法和循环法分别如下：PrivateFunctionFibonacci1(nAsInteger)AsLongDimaAsInteger,bAsIntegerIfn=1Orn=2ThenFibonac