某同学编写程序实现如下功能:程序运行时,在文本框Text1中输入车牌号,单击“判断”按钮 Command1,在文本框Text2中显示限行的工作日。如下图所示,尾号为5,则显示星期二限行。
(1)程序运行界面中都具有Caption属性的对象个数为
(2)实现上述功能的VB程序如下,请在画线处填入合适的代码。
Private Sub Command l_ Click()
Dim s As String, n As
Integer, x As String, y
As string
s=Text1. Text
n=
y=" "
For i=n To l Step-1
x=Mid(s, i,1)
If
If Val(x) Mod 5=4 Then
y="星期一"
Else If Val(x) Mod 5=0 Then
y="星期二"
Else If Val(x) Mod 5=1 Then
y="星期三"
Else If Val(x) Mod 5=2 Then
y="星期四"
Else
y="星期五"
End If
Exit For '退出循环
End If
Next
Text2. Text=
End sub
相似题推荐
①3 个数中包含 1-9 的全部数字,且不重复;
②3 个数的大小之比为 1:2:3。
如“192、384、576”是符合规则的一种组合。
现编写程序功能如下:单击“计算”按钮 Command1,在列表框 List1 中输出符合条件的数字组合,在标签 Label1 中输出组合数量。程序运行界面如图所示。
(1)上图程序运行界面中,有 Caption 属性的对象共
(2)实现程序功能的 VB 代码如下,请在划线处填入合适的代码。
Private Sub Command1_Click()
Dim f(0 To 9) As Integer
Dim i As Long, j As Integer, s As Integer
Dim tmp As Long, t As Integer, count As Integer
count = 0
For i = 123 To 333
For j =①
f(j) = 0
Next j
tmp = i + 2 * i * 1000 + 3 * i * 1000000
Do While tmp > 0
t =②
tmp = tmp \ 10
f(t) = 1
Loop
s = 1
For j = 1 To 9
s = s * f(j)
Next j
If③
List1.AddItem Str(i) + Str(2 * i) + Str(3 * i)
count = count + 1
End If
Label1.Caption = "共有" + Str(count) + "种组合"
Next i
End Sub
依据上述描述设计如下 VB 程序:
Dim xh(1 To 100) As Integer , xm(1 To 100) As String, cj(1 To 100) As Integer Dim n As Integer, m As Integer
Private Sub Form_Load()
'本过程从数据库依次读取 n 位同学的序号、姓名及成绩,然后按成绩降序排序,将学生序号、姓名成绩存储在数组 xh 、xm、cj 中,结果显示在List1 中,
End Sub
请回答下列问题:
(1)在设计程序界面时,要清空文本框中的显示内容,应修改文本框的
(2)程序中加框处代码有误,请改正。
(3)请在①②③划线处填入适当的代码。
①
②
③
转换前元素次序为:
12 2 5 3 6 9 4 10 8 5 6 9 6 3 5 8 11 2 8 9 |
转换为矩阵如下:
现要在矩阵中找一个规模为3*3的子方阵,使得该子方阵的各元素之和最大。
(1)若n=25,m=5,则该矩阵中共有3*3的子方阵个数为
(2)实现上述功能的VB程序如下,请在划线处填入合适代码。
Private Sub Command1_Click()
Dim a(1 To 100) As Integer
Dim sum(0 To 101) As Long ’sum(i)=a(1)+a(2)+a(3)+…+a(i)
Dim i As Integer, j As Integer, n As Integer, m As Integer, k As Integer
Dim ans As Long, begin As Integer, maxi As Integer
Dim maxsum As Long, s As String
n=Val(Text1.Text)
m=Val(Text2.Text)
If n Mod m <> 0 Then List1.AddItem “输入数据不符合要求”:Exit Sub
For i=1 To n
a(i)=Int(Rnd*50+1)
s=s+Str(a(i))
If i Mod m=0 Then List1.AddItem s:s=“”
Next i
k=3
sum(1)=a(1)
For i=2 To n ’求sum(i)
Next i
maxsum=0
ans=0
For i=1 To n\m-k+1
For j=k To m
begin=(i-1)*m+j-k+1
maxsum=maxsum+sum(j+(i-1)*m)-sum(j-k+(i-1)*m)
maxsum=maxsum+(j+(i+1)*m)-sum(j-k+(i+1)*m)
If maxsum>ans Then ans=maxsum:maxi=begin
maxsum=0
Next j
Next i
s= “”
For i=1 To k
For j=1 To k
s=s+Str(a (
Next j
List2.AddItem s
s=“”
Next i
List2.AddItem “maxsum=”+Str(ans)
End Sub