若L=25,N=3,t=2时,3个标记点位罝到起点的距离分别为7、13、15,可将2面旗子插到3个标记点中任意两个位置上,各种插旗方案如图所示。
If p+m>a(i)Then
c=c+1Else
________End If
Next i……
三、依次进行,(直到)用A的最末行各个数与B的第末列各个数对应相乘相加,结果是最末行第末列的数。如下图a所示:图1 图2
编写“商品销售统计”程序功能如下:窗体加载时从数据库中读取商品的相关数据,对各商品类别总销量及名次进行统计,结果在列表框 List1 中显示;单击“查询”按钮 Command1,按商品类别编号从小到大排列,同一类别商品按销量从大到小排序,在列表框 List2 中显示。程序运行界面如图3所示。For i = 1 To n '统计各类别商品总销量及商品总数
______________
k(b(i)) = k(b(i)) + 1
Next i
For i = 1 To m '计算各类别商品总销量的名次
p = 0
For j = 1 To m
If ts(i) < ts(j) Then p = p + 1
mc(i) = p + 1
Next j
Next i
List1.AddItem "类别 销量 名次"
For i = 1 To m
List1.AddItem gtype(i) + " " + Str(ts(i)) + " " + Str(mc(i))Next i
End SubFor i = 1 To m
a(i) = p
p = p + k(i)
Next i
For i = 1 To n
p = b(i)t(a(p)) = i
a(p) = a(p) + 1
Next i
pos = 1
For i = 1 To m '对各类别商品按商品销量进行排序
For j = pos To pos + k(i) - 2
__________________tmp =t(j): t(j) = t(p): t(p) = tmp
Next j
pos = pos + k(i)
Next i
List2.AddItem "类别 商品 商品销量"Dim i As Integer, p As Integer
p = head - 1
For i = head To tail
If s(t(i)) > s(t(p)) Then p = i
Next i
f = p
End Function
Function geshi(s As String) As String '格式输出,代码略
End FunctionDim i As Integer, t As Integer, code As Integer, mc As Integer
Dim a (0 To 100) As Integer
Dim b (0 To 100) As Integer
Dim codena _________ To 3 ) As String
codena(1) = “游泳” :codena(2) = “跑步” :codena(3) = “跳远”
code = Val(Text1.Text)
For i = 0 To 100
a(i) = 0
Next i
sum = 0
For i = 1 To m ’计算每个分数的个数及体能测试优秀的人数
t = ______
a(score(t)) = a(score(t)) +1
If score(t) >= 90 Then sum = sum+1
Next i
mc = 1
For i = 100 To 0 Step -1 ’计算每个分数的名次
If a(i) <> 0 Then
b(i) = mc
mc = ____
End If
Next i
List2.Clear
List2.AddItem "姓名"+ ____ +"名次"
For i = 1 To m
’ 在 List2 中输出 m 个学生的姓名、制定项目的分数以及名次,代码略
Next i
Sum = Int( sum / m * 10000 + 0.5 ) / 100
Label2.Caption = “ 优秀率是:” + Str( sum ) + ” % ”
End SubIf ___________ Then x=a(2*i- 1)
Do While x <a(2* i)编写 VB 程序,实现字母排队功能:在文本框 Text1 中输入待排字母串后,单击“排队”按钮Command1,在列表框 List1 中显示排队结果。程序运行界面如图 2 所示。图 2
请回答下列问题:ch = ________
If ch >= "A" And ch <= "Z" Then su = su + ch
If ch >= "a" And ch <= "z" Then sd = sd + ch
Next iIf flag(i) And i <= 26 Then su = su + Chr(i + 64)
If flag(i) And i > 26 Then
Next ich = Mid(s, i, 1)
If ch < Min Then mini = i: Min = ch
__________
Next inx = Len(s)
sort = Mid(s, 1, 1)
i = 2
nc = 1
Do While nc <= 2
For j = wz + k To nx ^ ((1 + k) \ 2) Step k