大一各专业汇总vb工管基础编程

第一题要求（12分求各位数字之和PrivateSubDimsAsString,iAsInteger,jAsInteger,nAsIntegers=Text2.Textn=Fori=1ToLen(s)-Forj=i+1ToIfMid(s,i,1)>Mid(s,j,1)Thenn=n+1EndPrintnPrivateSubDimsAsString,iAsInteger,nAsInteger,chAsStrings=Text2.Textn=Fori=1ToLen(s)ch=Mid(s,i,Ifch>="0"Andch<="9"Thenn=n+1EndPrintnEnd第二题要求（18分指定编写过程并调用此过程，覆盖以下算法Functionf素数(ByValnAsIntegerAsDimiAsIntegerFori=2Ton-IfnModi=0ThenExitEndFunctionf最大公约数(ByValxAsIntegerByValyAsIntegerAsIntegerDimiAsIntegerFori=xTo1Step-IfxModi0AndyModi0Thenf最大公约数=iEndIfEndSubs冒泡法(xAsDimiAsInteger,jAsInteger,cAsInteger,nAsIntegerFori=UBound(x)-1ToLBound(x)Step-1n=Forj=LBound(x)ToIfx(j)>x(j+1)Thenc=x(j)x(j)=x(j+1)x(j+1)=cn=n+1EndIf

Ifn=0ThenExitEndFunctionf顺序查找(xAsIntegerByValnAsIntegerAsIntegerDimiAsIntegerFori=LBound(x)ToIfx(i)=nfiExitFunctionEndEndFunctionf回文数(ByValxAsLongAsDimsAsString,chAsString,iAsInteger,rAsStrings=CStr(x)r=Fori=1ToLen(s)ch=Mid(s,i,1)r=ch&rIfrsThenfTrueEndFunctionFunctionf阶乘(ByValnAsIntegerAsDoubleIfn=0Orn=1Thenf阶乘

f阶乘n*f阶乘(nEndEnd递归函数求Fibonacci数列；Functionfib(ByValnAsIntegerAsLongIfn=1Orn=2Thenfib=fib=fib(n-1)+fib(n-EndEnd矩阵不靠边元和Functionf靠边元和(x()AsInteger)AsLongDimiAsInteger,jAsIntegerFori=LBound(x,1)ToUBound(x,Forj=LBound(x,2)ToUBound(x,IfiLBound(x1)OriUBound(x,2)OrjLBound(x,2)OrjUBound(x,2)Thenf靠边元和=f靠边元和+x(i,j)EndEndFunctionf不靠边元和(x()AsInteger)AsLongDimiAsInteger,jAsIntegerFori=LBound(x,1)ToUBound(x,Forj=LBound(x,2)ToUBound(x,IfNot(iLBound(x,1)OriUBound(x,2)OrjLBound(x,2)OrjUBound(x,2))Thenf不靠边元和=f不靠边元和+x(i,j)EndEndSubs转置(xAsIntegeryAs