计数与求和 求数组最大值 fmax = x (1) For i = 2 To n If x (i) > fmax Then fmax = x (i) Nex t i 输入数组 For i = 1 To m a(i) = Inpu tBox ("a(" + Str(i) + ")=") Nex t i 输出数组(每行n 个) For i = 1 To m Print a(i); if i mod n =0 then print Nex t i 随机数产生[N,M]范围内数组 For i = 1 To m a(i) = int(rnd*(M-N+1))+N Nex t i 数组元素倒置 For i =1 To n\2 t=A(i) A(i)=A(n-i+1) A(n-i+1)=t Nex t I 在数组中查找数 1.原始算法 For i = 1 To n If x = a(i) Then j = i Nex t i 2.变种1 For i = 1 To 8 If x = a(i) ThenEx it For Nex t i 在数组中删除特定的数 For i = 1 To 8 If x = a(i) Then j = i Nex t i For i = j To 7 a(i) = a(i + 1) Nex t i 求两个整数的最大公约数、最小公倍数 1．原始程序 Dim n%,m%,nm%,r% m=Val(Inpu tBox ("m=")) n=Val(Inpu tBox ("n=")) nm=n*m If m 0) m=n n=r r= m mod n Loop Print "最大公约数=", n Print "最小公倍数=", nm/n 2．变种 1 Dim n%,m%,nm%,r% m=Val(Inpu tBox ("m=")) n=Val(Inpu tBox ("n=")) nm=n*m r=m mod n Do While (r <> 0) m=n n=r r= m mod n Loop Print "最大公约数=", n Print "最小公倍数=", nm/n 3．变种 2 Dim n%,m%,nm%,r% m=Val(Inpu tBox ("m=")) n=Val(Inpu tBox ("n=")) nm=n*m If m 0) r= m mod n m=n n=r Loop Print "最大公约数=", m Print "最小公倍数=", nm/m 判断素数及验证哥德巴赫猜想 1．判断 N 是否是素数 For i= 2 To Int(Sqr(n)) If n Mod i = 0 Then Ex it For Nex t i If i> Int(Sqr(n)) Then Print n; " 是素数" Else Print n; " 不是素数" End If 2. 判断 N 是否是素数(变种 1) flag=0 For i= 2 To Int(Sqr(n)) If n Mod i = 0 Then flag =1 :Ex it For Nex t i If flag =0 Then Print n; " 是素数" Else Print n; " 不是素数" End If 3. 哥德巴赫猜想 Dim N%, N1%, N2%, I%, ...
