public class Primes
{
public static void main(String[] args)
{
int sum = 0;
int i = 100;
while (i <= 500)
{
boolean isPrime = true;
for (int j = 2; j < i; j++)
{
if (i % j == 0)
{
isPrime = false;
break;
}
}
if (isPrime)
{
System.out.print(i+"\t");
sum = sum + i;
}
i++;
}
System.out.print("\n素数的和是: " + sum);
}
}
温馨提示:内容为网友见解,仅供参考