- public class SearchPrime {
- public static void main(String[] args) {
- for (int number = 2, count = 0; count <= 10; number++) {
- if (isPrime(number)) {
- System.out.println(number);
- count++;
- }
- }
- }
- private static boolean isPrime(int number) {
- for (int divisor = 2; divisor <= number / 2; divisor++) {
- if (number % divisor == 0) {
- return false;
- }
- }
- return true;
- }
- }
複製程式碼 |