We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Advanced
  4. Prime Checker
  5. Discussions

Prime Checker

Sort by

recency

|

348 Discussions

|

  • martinsdefreita1
     + 0 comments

    Discovered formula of prime numbers, need points, looking for a job. Thank you. Experience programming with java 18 years. Currently 30 years old.

  • jhoneder
     + 0 comments

    //Java 15

    import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.List;
import java.util.stream.Collectors;

import static java.lang.System.in;

class Prime {

    public  void checkPrime(int... args) {
        for (int arg : args) {
            if (isPrime(arg)) {
                System.out.print(arg + " ");
            }
        }
        System.out.println();
    }

    public boolean isPrime(int num) {
        if(num == 1) {
            return false;
        }
        for(int i=2; i<num; i++) {
            if(num%i==0) {
                return false;
            }
        }
        return true;
    }

}

public class Solution {
    public static void main(String[] args) {
        List<Integer> integerList;
        Prime prime = new Prime();
        try(BufferedReader br=new BufferedReader(new InputStreamReader(in))){
             integerList = br.lines().filter(string -> string.matches("\\d+")).map(Integer::parseInt).collect(Collectors.toList());
             int n1 = integerList.get(0);
             int n2 = integerList.get(1);
             int n3 = integerList.get(2);
             int n4 = integerList.get(3);
             int n5 = integerList.get(4);
             prime.checkPrime(n1);
             prime.checkPrime(n1,n2);
             prime.checkPrime(n1,n2,n3);
             prime.checkPrime(n1,n2,n3,n4,n5);
        } catch (IOException e) {
            System.out.println(e);
        }
    }

}

  • jtconlineclass
     + 0 comments

    class Prime{ void checkPrime(int ... ar1){ for(int i = 0 ; i <= ar1.length-1 ; i++){ boolean isPrime = true; for(int j = 2 ; j <= ar1[i] / 2 ; j++){ if(ar1[i] % j == 0){ isPrime = false; break; } } if(isPrime){ System.out.print(ar1[i]); } } } }

  • tony_hano
     + 0 comments

    import java.io.; import java.util.; import java.text.; import java.math.; import java.util.regex.; import java.lang.reflect.;

    import static java.lang.System.in;

    class Prime {

    public void checkPrime (int... numbers){
     for (int num : numbers) {
        if (num <= 2) {
        if (num == 2) {
            System.out.print(num+ " ");
            }
            else {
                     }
        }
        else if (num % 2 == 0) {
               }
        else {
                    for (int halfNum = (num / 2) ; halfNum >= 1 ; halfNum -= 2) {
                    if (halfNum % 2 == 0) {
halfNum++;
    }
        if (num % halfNum == 0){
     //   System.out.println();
     if (halfNum >= 3) {
        break;
    }
    else {
        System.out.print(num+ " ");
                    }
       }
                 }
         }
         }System.out.println();
         }
         }

    } }}

  • anatoltbcm
     + 0 comments

    Java 7 solution:

    import static java.lang.System.in;

class Prime {
    public void checkPrime(int... args) {
        for (int arg : args) {
            if (isPrime(arg)) {
                System.out.print(arg + " ");
            }
        }
        System.out.println();
    }

    private boolean isPrime(int num) {
        if (num == 1) {
            return false;
        }
        int maxDivisor = (int) Math.sqrt(num);
        for (int i = 2; i <= maxDivisor; i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}