代碼為：
Dim i As Integer, m As Integer, n As Integer, sum As Integer, p As Integer
m = Val(Text1.Text)
n = Val(Text2.Text)
sum = 0
For p = m To n
For i = 2 To p - 1
If (p Mod i) = 0 Then
Exit For
End?If
Next?i
If p = i Then
sum = sum + p
End If
Next p
Text3.Text = str（sum）
擴展資料：
註意事項
m到n以內的素數
#include<iostream>
using namespqce std;
bool isPrime(int n)
{
if (n <= 1)
return false;
if (2 == n)
return true;
for (int i = 2; i < sqrt(n) + 1; i++){
if (n%i == 0)
return false;
}
return true;
}
vector<int> mTonPrime(int m, int n)
{
vector<int> aPrime;
for (int i = m; i <= n; i++)
{
if (isPrime(i))
aPrime.push_back(i);
}
return aPrime;
}?
int main()
{
vector<int> res = mTonPrime(1, 100);
for (int i = 0; i < res.size(); i++){
cout << res[i] << " ";
}
cout << endl;
return 0;
}