📄 exercise3_25.java
字号:
// Exercise3_25.java: Print all prime numbers between
// 2 and 1000. Display 8 prime numbers per line.
public class Exercise3_25 {
// Main method
public static void main(String[] args) {
int count = 1; // Count the number of prime numbers
int number = 2; // A number to be tested for primeness
boolean isPrime = true; // If the current number is prime?
System.out.println("The prime numbers from 2 to 1000 are \n");
// Repeatedly test if a new number is prime
while (number <= 1000) {
// Assume the number is prime
isPrime = true;
// Set isPrime to false, if the number is prime
for (int divisor = 2; divisor <= number / 2; divisor++) {
if (number % divisor == 0) { // If true, the number is prime
isPrime = false;
break; // Exit the for loop
}
}
// Print the prime number and increase the count
if (isPrime) {
if (count%8 == 0) {
// Print the number and advance to the new line
System.out.println(number);
}
else
System.out.print(number + " ");
count++; // Increase the count
}
// Check if the next number is prime
number++;
}
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -