收藏 分销(赏)

VB循环程序例题100道附答案.doc

上传人:w****g 文档编号:1961348 上传时间:2024-05-12 格式:DOC 页数:32 大小:188KB 下载积分:12 金币
下载 相关 举报
VB循环程序例题100道附答案.doc_第1页
第1页 / 共32页
VB循环程序例题100道附答案.doc_第2页
第2页 / 共32页


点击查看更多>>
资源描述
VB循环程序例题附答案 1.素数 1. [100,999]范围内同时满足以下两个条件的十进制数. ⑴其个位数字与十位数字之和除以10所得的余数是百位数字;⑵该数是素数; 求有多少个这样的数? 15 n = 0 For i = 100 To 999 a = i \ 100 b = i \ 10 Mod 10 c = i Mod 10 If (c + b) Mod 10 = a Then x = 0 For j = 2 To i - 1 If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then n = n + 1 End If Next i Print n 2. [300,800]范围内同时满足以下两个条件的十进制数. ⑴其个位数字与十位数字之和除以10所得的余数是百位数字 ;⑵该数是素数;求满足上述条件的最大的三位十进制数。 761 For i = 300 To 800 a = i \ 100 b = i \ 10 Mod 10 c = i Mod 10 If (c + b) Mod 10 = a Then x = 0 For j = 2 To i - 1 If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then s = i End If Next i Print s 3. 除1和它本身外,不能被其它整数整除的正整数称为素数(注:1不是素数,2是素数)。若两素数之差为2 ,则称两素数为双胞胎数,问[31,601]之间有多少对双胞胎数。 22 n = 0 For i = 31 To 601 - 2 x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 For j = 2 To Sqr(i + 2) If (i + 2) Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then n = n + 1 End If Next i Print n 4. 数学家哥德巴赫曾猜测:任何大于6的偶数都可以分解成两个素数(素数对)的和。但有些偶数可以分解成多种素数对的和,如: 10=3+7,10=5+5,即10可以分解成两种不同的素数对。试求6744可以分解成多少种不同的素数对(注: A+B与B+A认为是相同素数对) 144 n = 0 For i = 2 To 6744 / 2 x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 For j = 2 To Sqr(6744 - i) If (6744 - i) Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then n = n + 1 End If Next i Print n 5. 两个素数之差为2,则称这两个素数为双胞胎数。求出[200,1000]之间的最大一对双胞胎数的和。 1764 For i = 200 To 1000 - 2 x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 For j = 2 To Sqr(i + 2) If (i + 2) Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then s = i + i + 2 End If Next i Print s 6. 一个素数(设为p)依次从最高位去掉一位,二位,三位,……,若得到的各数仍都是素数(注:除1和它本身外,不能被其它整数整除的正整数称为素数,1不是素数,2是素数),且数p的各位数字均不为零,则称该数p为逆向超级素数。例如,617,17,7都是素数,因此617是逆向超级素数,尽管503,03,3都是素数,但它不是逆向超级素数,因为它包含有零。试求[100,999]之内的所有逆向超级素数的个数。 39 n = 0 For i = 100 To 999 a = i \ 10 Mod 10 b = i Mod 10 If a <> 0 And b <> 0 And b <> 1 Then x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 c = i Mod 100 For j = 2 To Sqr(c) If c Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then z = 0 For j = 2 To Sqr(b) If b Mod j = 0 Then z = 1: Exit For Next j If z = 0 Then n = n + 1 End If End If End If Next i Print n 7. 德国数学家哥德巴赫曾猜测:任何大于6的偶数都可以分解成两个素数(素数对)的和。但有些偶数可以分解成多种素数对的和,如: 10=3+7,10=5+5,即10可以分解成两种不同的素数对。试求1234可以分解成多少种不同的素数对(注: A+B与B+A认为是相同素数对) 25 n = 0 For i = 2 To 1234 / 2 x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 For j = 2 To Sqr(1234 - i) If (1234 - i) Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then n = n + 1 End If Next i Print n 8.求[100,900]之间相差为12的素数对(注:要求素数对的两个素数均在该范围内)的个数。 50 n = 0 For i = 100 To 900 - 12 x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 For j = 2 To Sqr(i + 12) If (i + 12) Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then n = n + 1 End If Next i Print n 9. 一个素数(设为p)依次从最高位去掉一位,二位,三位,……,若得到的各数仍都是素数(注:1不是素数),且数p的各位数字均不为零,则称该数p为逆向超级素数。例如,617,17,7都是素数,因此617是逆向超级素数,但尽管503,03,3都是素数,但它不是逆向超级素数,因为它包含有零。试求[100,999]之内的所有逆向超级素数的和。 21645 s = 0 For i = 100 To 999 a = i \ 10 Mod 10 b = i Mod 10 If a <> 0 And b <> 0 And b <> 1 Then x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 c = i Mod 100 For j = 2 To Sqr(c) If c Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then z = 0 For j = 2 To Sqr(b) If b Mod j = 0 Then z = 1: Exit For Next j If z = 0 Then s = s + i End If End If End If Next i Print s 10. 一个素数(设为p)依次从最高位去掉一位,二位,三位,……,若得到的各数仍都是素数(注:1不是素数,2是素数),且数p的各位数字均不为零,则称该数p为逆向超级素数。例如,617,17,7都是素数,因此617是逆向超级素数,但尽管503,03,3都是素数,但它不是逆向超级素数,因为它包含有零。试求[100,999]之内的所有逆向超级素数从大到小数的第10个素数是多少? 797 n = 0 For i = 999 To 100 Step -1 a = i \ 10 Mod 10 b = i Mod 10 If a <> 0 And b <> 0 And b <> 1 Then x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 c = i Mod 100 For j = 2 To Sqr(c) If c Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then z = 0 For j = 2 To Sqr(b) If b Mod j = 0 Then z = 1: Exit For Next j If z = 0 Then n = n + 1: If n = 10 Then s = i End If End If End If Next i Print s 11. 一个自然数是素数,且它的数字位置经过任意对换后仍为素数,则称为绝对素数。如13,试求所有两位绝对素数的和。 429 s = 0 For i = 10 To 99 a = i \ 10 b = i Mod 10 x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 c = b * 10 + a For j = 2 To Sqr(c) If c Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then s = s + i End If Next i Print s 12. 在[200,900]范围 内同时满足以下两个条件的十进制数:⑴其个位数字与十位数字之和除以10所得的余数是百位数字; ⑵该数是素数;问有多少个这样的数? 14 n = 0 For i = 200 To 900 a = i \ 100 b = i \ 10 Mod 10 c = i Mod 10 If (c + b) Mod 10 = a Then x = 0 For j = 2 To i - 1 If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then n = n + 1 End If Next i Print n 13. 一个素数,依次从个位开始去掉一位,二位.....,所得的各数仍然是素数,称为超级素数。求[100,999]之内超级素数的个数。 14 n = 0 For i = 100 To 999 x = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then a = i \ 10 y = 0 For j = 2 To Sqr(a) If a Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then b = i \ 100 If b <> 1 Then z = 0 For j = 2 To Sqr(b) If b Mod j = 0 Then z = 1: Exit For Next j If z = 0 Then n = n + 1 End If End If End If Next i Print n 14. 若两个连续的自然数的乘积减1后是素数,则称此两个连续自然数为友数对,该素数称为友素数。例如,由于 8*9-1=71, 因此,8与9是友素数对,71是友素数。求[100,200]之间的第10个友素数对所对应的友素数的值(按由小到大排列)。 17291 For i = 100 To 199 a = i * (i + 1) - 1 x = 0 For j = 2 To Sqr(a) If a Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then n = n + 1 If n = 10 Then s = a End If Next i Print s 15. 求[2,400]中相差为10的相邻素数对(两数中间没有其它素数)的对数。 5 n = 0 For I = 2 To 400 - 10 x = 0 For j = 2 To Sqr(I) If I Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then y = 0 For j = 2 To Sqr(I + 10) If (I + 10) Mod j = 0 Then y = 1: Exit For Next j If y = 0 Then For k = I + 1 To I + 9 z = 0 For k1 = 2 To Sqr(k) If k Mod k1 = 0 Then z = 1: Exit For Next k1 If z = 0 Then Exit For Next k If k = I + 10 Then n = n + 1 End If End If Next I Print n 16. 若两个连续的自然数的乘积减1后是素数,则称此两个连续自然数为友数对,该素数称为友素数。例如,由于 8*9-1=71, 因此,8与9是友数对,71是友素数。求[50,150]之间的友数对的数目。38 n = 0 For i = 50 To 150 a = i * (i + 1) - 1 x = 0 For j = 2 To Sqr(a) If a Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then n = n + 1 End If Next i Print n 17. 若两个连续自然数乘积减1后是素数,则称此两个自然连续数为友数对,该素数称为友素数,例:2*3-1=5,因此2与3是友数对,5是友素数,求[40,119]之间友素数对的数目。 30 n = 0 For i = 40 To 119 a = i * (i + 1) - 1 x = 0 For j = 2 To Sqr(a) If a Mod j = 0 Then x = 1: Exit For Next j If x = 0 Then n = n + 1 End If Next i Print n 18. 梅森尼数是指能使2^n-1为素数的数n,求[1,21]范围内有多少个梅森尼数? 7 n = 0 For i = 2 To 21 x = 2 ^ i - 1 k = 0 For j = 2 To Sqr(x) If x Mod j = 0 Then k = 1 Next j If k = 0 Then n = n + 1 Next i Print n 19. [300,800]范围内同时满足以下两个条件的十进制数. ⑴其个位数字与十位数字之和除以10所得的余数是百位数字 ;⑵该数是素数;求满足上述条件的最大的三位十进制数。 761 For i = 300 To 800 a = i \ 100 b = i \ 10 Mod 10 c = i Mod 10 If (c + b) Mod 10 = a Then k = 0 For j = 2 To Sqr(i) If i Mod j = 0 Then k = 1 Next j If k = 0 Then s = i End If Next i Print s 2. 取数字 20. 求符合下列条件的四位完全平方数(某个正整数A是另一个正整数B的平方,则称A为完全平方数),它的千位数字与十位数字之和等于百位数字与个位数字之积,例如,3136=562, 且3+3=1*6 故3136是所求的四位完全平方数. 求其中最大的一个数。 7921 For i = 1000 To 9999 x = Sqr(i) If x = Int(x) Then a = i \ 1000 b = i \ 100 Mod 10 c = i \ 10 Mod 10 d = i Mod 10 If (a + c) = b * d Then s = i End If Next i Print s 21.设某四位数的千位数字平方与十位数字的平方之和等于百位数字的立方与个位数字的立方之和,例如,对于四位数:3201, 3^2+0^2=2^3+1^3,试问所有这样的四位数之和是多少?97993 s = 0 For i = 1000 To 9999 a = i \ 1000 b = i \ 100 Mod 10 c = i \ 10 Mod 10 d = i Mod 10 If (a ^ 2 + c ^ 2) = b ^ 3 + d ^ 3 Then s = s + i Next i Print s 22. 设某四位数的千位数字与十位数字的和等于百位数字与个位数字的积,例如,对于四位数:9512,9+1=5*2,试问所有这样的四位数之和是多少? 1078289 s = 0 For i = 1000 To 9999 a = i \ 1000 b = i \ 100 Mod 10 c = i \ 10 Mod 10 d = i Mod 10 If (a + c) = b * d Then s = s + i Next i Print s 23. 有一个三位数满足下列条件: (1)此三位数的三位数字各不相同; (2)此三位数等于它的各位数字的立方和。试求所有这样的三位数之和。 1301 s = 0 For i = 100 To 999 a = i \ 100 b = i \ 10 Mod 10 c = i Mod 10 If (a ^ 3 + b ^ 3 + c ^ 3) = i And a <> b And b <> c And c <> a Then s = s + i Next i Print s 24. 求[1,999]之间能被3整除,且至少有一位数字是5的所有正整数的个数。 91 n = 0 For i = 1 To 999 a = i \ 100 b = i \ 10 Mod 10 c = i Mod 10 If i Mod 3 = 0 And (a = 5 Or b = 5 Or c = 5) Then n = n + 1 Next i Print n 25. 有一个三位数满足下列条件: (1)此三位数的三位数字各不相同; (2)此三位数等于它的各位数字的立方和。试求所有这样的三位数中最大的一个是多少? 407 s = 0 For i = 100 To 999 a = i \ 100 b = i \ 10 Mod 10 c = i Mod 10 If (a ^ 3 + b ^ 3 + c ^ 3) = i And a <> b And b <> c And c <> a Then s = i Next i Print s 26. 有一个三位数满足下列条件: (1)此三位数的三位数字各不相同; (2)此三位数等于它的各位数字的立方和。试求这种三位数共有多少个? 4 n = 0 For i = 100 To 999 a = i \ 100 b = i \ 10 Mod 10 c = i Mod 10 If (a ^ 3 + b ^ 3 + c ^ 3) = i And a <> b And b <> c And c <> a Then n = n + 1 Next i Print n 27. 求五位数各位数字的平方和为100的最大的五位数。 94111 For i = 10000 To 99999 a = i \ 10000 b = i \ 1000 Mod 10 c = i \ 100 Mod 10 d = i \ 10 Mod 10 e = i Mod 10 If a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 + e ^ 2 = 100 Then s = i Next i Print s 28. 所谓“水仙花数”是指一个三位数,其各位数字的三次方之和等于该数本身,例如:153=1^3+3^3+5^3,故153是水仙花数,求[100,999]之间所有水仙花数之和。 1301 s = 0 For i = 100 To 999 a = i \ 100 b = i \ 10 Mod 10 c = i Mod 10 If (a ^ 3 + b ^ 3 + c ^ 3) = i Then s = s + i Next i Print s 29. 设某四位数的各位数字的平方和等于100,问共有多少个这种四位数? 49 n = 0 For i = 1000 To 9999 a = i \ 1000 b = i \ 100 Mod 10 c = i \ 10 Mod 10 d = i Mod 10 If a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 100 Then n = n + 1 Next i Print n 30. 回文数是指正读和反读都一样的正整数。例如3773是回文数。求出[1000,9999]以内的所有回文数的个数。 90 n = 0 For i = 1000 To 9999 a = i \ 1000 b = i \ 100 Mod 10 c = i \ 10 Mod 10 d = i Mod 10 If a + b * 10 + c * 100 + d * 1000 = i Then n = n + 1 Next i Print n 3. 分硬币 31. 把一张一元钞票,换成一分、二分和五分硬币,每种至少8枚,问有多少种方案? 80 n = 0 For i = 8 To 100 For j = 8 To 50 For k = 8 To 20 If (i + 2 * j + 5 * k = 100) Then n = n + 1 Next k, j, i Print n 32. 50元的整币兑换成5元、2元和1元币值(三种币值均有、缺少一种或两种都计算在内)的方法有多少种。 146 n = 0 For i = 0 To 50 For j = 0 To 25 For k = 0 To 10 If (i + 2 * j + 5 * k = 50) Then n = n + 1 Next k, j, i Print n 33. 50元的整币兑换成5元、2元和1元币值(要求三种币值均有)的方法有多少种。 106 n = 0 For i = 1 To 50 For j = 1 To 25 For k = 1 To 10 If (i + 2 * j + 5 * k = 50) Then n = n + 1 Next k, j, i Print n 34. 马克思曾经做过这样一道趣味数学题:有30个人在一家小饭店里用餐,其中有男人、女人和小孩,每个男人花了3先令,每个女人花了2先令,每个小孩花了1先令,共花去50先令。如果要求男人、女人和小孩都有人参与,试求有多少种方案分配男人、女人和小孩的人数。9 n = 0 For i = 1 To 50 For j = 1 To 25 k = 30 - i - j If (i + 2 * j + 3 * k = 50) And k > 0 Then n = n + 1 Next j, i Print n 4. 勾股、弦数 35. A,B,C是三个小于或等于100正整数,当满足1/A^2+1/B^2=1/C^2关系时,称为倒勾股数。求130<A+B+C<150且A>B>C的倒勾股数有多少组。 1 For c = 1 To 100 For b = c + 1 To 100 For a = b + 1 To 100 i = a + b + c If (i > 100 And i < 150 And (1 / (a * a) + 1 / (b * b) = 1 / (c * c))) Then n = n + 1 Print a, b, c End If Next a, b, c Print n 36. 倒勾股数是满足公式: 1/A^2+1/B^2=1/C^2 的一组正整数(A,B,C),例如,(156,65,60)是倒勾股数,因为:1/156^2+1/65^2=1/60^2。假定A>B>C,求A,B,C之和小于100的倒勾股数有多少组? 2 For c = 1 To 100 For b = c + 1 To 100 For a = b + 1 To 100 i = a + b + c If (i < 100 And (1 / (a * a) + 1 / (b * b) = 1 / (c * c))) Then n = n + 1 Print a, b, c End If Next a, b, c Print n 37. 勾股弦数是满足公式: A^2+B^2=C^2 (假定A<B<C)的一组正整数(A,B,C),例如,(3,4,5)是勾股弦数,因为:3^2+4^2=5^2。求A,B均小于25且A+B+C<=100的勾股弦数的个数。 11 n = 0 For c = 1 To 100 For a = 1 To 24 For b = a + 1 To 24 s = a + b + c If a ^ 2 + b ^ 2 = c ^ 2 And s <= 100 Then n = n + 1 Next b, a, c Print n 38. 倒勾股数是满足公式: 1/A^2+1/B^2=1/C^2 的一组正整数(A,B,C),例如,(156,65,60)是倒勾股数,因为:1/156^2+1/65^2=1/60^2。假定A>B>C,求A,B,C均小于或等于100的倒勾股数有多少组? 5 For c = 1 To 100 For b = c + 1 To 100 For a = b + 1 To 100 i = a + b + c If 1 / (a * a) + 1 / (b * b) = 1 / (c * c) Then n = n + 1 Print a, b, c End If Next a, b, c Print n 39. 勾股弦数是满足公式: A^2+B^2=C^2 (假定A<B<C)的一组正整数(A,B,C),例如,(3,4,5)是勾股弦数,因为:3^2+4^2=5^2。求A,B,C均小于或等于100的勾股弦数中A+B+C的最大值。 240 Max = 0 For a = 1 To 100 For b = a + 1 To 100 For c = b + 1 To 100 s = a + b + c If a ^ 2 + b ^ 2 = c ^ 2 And s > Max Then Max = s Next c, b, a Print Max 40 若某整数平方等于某两个正整数平方之和的正整数称为弦数。例如:由于3^2+4^2=5^2,则5为弦数,求[100,200]之间弦数的个数。 77 n = 0 For k = 100 To 200 For i = 1 To k For j = i + 1 To k If i ^ 2 + j ^ 2 = k ^ 2 Then n = n + 1 Next j, i, k Print n 41 若某正整数平方等于某两个正整数平方之和,称该正整数为弦数。例如:由于3^2+4^2=5^2,则5为弦数,求[131,200]之间最小的弦数。 135 For k = 131 To 200 For i = 1 To k For j = i + 1 To k If i ^ 2 + j ^ 2 = k ^ 2 Then GoTo 10 Next j, i, k 10 Print k 5.完数因子 42 求在[10,1000]之间的所有完数之和。各真因子之和(不包括自身)等于其本身的正整数称为完数。例如:6=1+2+3,6是完数。 524 Sum = 0 For m = 10 To 1000 s = 0 For i = 1 To m - 1 If m Mod i = 0 Then s = s + i Next i If s = m Then Sum = Sum + m Next m Print Sum 43 一个数如果恰好等于它的所有真因子之和,这个数就称为“完数”。例如, 6的真因子为1,2,3,而6=1+2+3,因此,6是“完数”。求[1,1000]之间的最大完数。 496 Sum = 0 For m = 1 To 1000 s = 0 For i = 1 To m - 1 If m Mod i = 0 Then s = s + i Next i If s = m Then Sum = m Next m Print Sum 44 一个数如果恰好等于它的所有真因子之和,这个数就称为“完数”。例如,6的真因子为1,2,3,而6=1+2+3,因此,6是“完数”。求[1,1000]之间的第二大完数。 28 Sum = 0 For m = 1 To 1000 s = 0 For i = 1 To m - 1 If m Mod i = 0 Then s = s + i Next i If s = m Then n = n + 1 If n = 2 Then Sum = m: Exit For Next m Print Sum 45 一个数如果恰好等于它的所有真因子之和,这个数就称为“完数”。例如,6的真因子为1,2,3,而6=1+2+3,因此,6是“完数”。求1000以内的所有完数之和。 530 Sum = 0 For m = 1 To 1000 s = 0 For i =
展开阅读全文

开通  VIP会员、SVIP会员  优惠大
下载10份以上建议开通VIP会员
下载20份以上建议开通SVIP会员


开通VIP      成为共赢上传

当前位置:首页 > 包罗万象 > 大杂烩

移动网页_全站_页脚广告1

关于我们      便捷服务       自信AI       AI导航        抽奖活动

©2010-2025 宁波自信网络信息技术有限公司  版权所有

客服电话:0574-28810668  投诉电话:18658249818

gongan.png浙公网安备33021202000488号   

icp.png浙ICP备2021020529号-1  |  浙B2-20240490  

关注我们 :微信公众号    抖音    微博    LOFTER 

客服