'这是一个递归程序的经典题目,数学上称斐波拉契数列,如果算前40项,会要点时间的,注意等待(大约70秒)Private Sub Command1_Click()Text1.Text = FPlc(40)End SubPrivate Function FPlc(n As Long) As Long If n = 1 Then
FPlc = 0 End If
If n = 2 Then
FPlc = 1 End If
If n > 2 Then
FPlc = FPlc(n - 1) + FPlc(n - 2) End IfE...
在窗体加了Textbox和命令按钮Private Sub Command1_Click()Dim a As LongDim b As LongDim c As LongDim i As Integera = 0b = 1Text1.Text = ""For i = 1 To 40c = a + bText1.Text = Text1.T...