若数组f[1,9]中依次存放着2,6,3,9,1,4,7,5,8这9个整数,算法运行后s的值为多少?
若数组f[1,9]中依次存放着2,6,3,9,1,4,7,5,8这9个整数,算法运行后s的值为多少?
s=0
For k=1 To 9
If k mod 3=2 Then s=s+f(k)
Next k
s=0
For k=1 To 9
If k mod 3=2 Then s=s+f(k)
Next k
赞 rick900 幼苗
共回答了13个问题采纳率：100% 举报
循环开始.
循环: k = 1
k mod 3 = 1,不成立
循环: k = 2
k mod 3 = 2,成立
s = s + f(k) = 0 + 6 = 6
循环: k = 3
k mod 3 = 0,不成立
循环: k = 4
k mod 3 = 1,不成立
循环: k = 5
k mod 3 = 2,成立
s = s + f(k) = 6 + 1 = 7
循环: k = 6
k mod 3 = 0,不成立
循环: k = 7
k mod 3 = 1,不成立
循环: k = 8
k mod 3 = 2,成立
s = s + f(k) = 7 + 5 = 12
循环: k = 9
k mod 3 = 0,不成立
循环结束.
最后s=12
循环: k = 1
k mod 3 = 1,不成立
循环: k = 2
k mod 3 = 2,成立
s = s + f(k) = 0 + 6 = 6
循环: k = 3
k mod 3 = 0,不成立
循环: k = 4
k mod 3 = 1,不成立
循环: k = 5
k mod 3 = 2,成立
s = s + f(k) = 6 + 1 = 7
循环: k = 6
k mod 3 = 0,不成立
循环: k = 7
k mod 3 = 1,不成立
循环: k = 8
k mod 3 = 2,成立
s = s + f(k) = 7 + 5 = 12
循环: k = 9
k mod 3 = 0,不成立
循环结束.
最后s=12
1年前
8
可能相似的问题
你能帮帮他们吗