From c7a662d18e82240c90916050b9bbd9a7ab0731c5 Mon Sep 17 00:00:00 2001 From: Kristian Sooklal Date: Thu, 3 Oct 2019 10:20:05 -0400 Subject: [PATCH] Java Prime Checker Hackerrank Challenge Add Solution for https://www.hackerrank.com/challenges/prime-checker/problem --- java/PrimeChecker/Solution.java | 74 +++++++++++++++++++++++++++++++++ 1 file changed, 74 insertions(+) create mode 100644 java/PrimeChecker/Solution.java diff --git a/java/PrimeChecker/Solution.java b/java/PrimeChecker/Solution.java new file mode 100644 index 0000000..425c435 --- /dev/null +++ b/java/PrimeChecker/Solution.java @@ -0,0 +1,74 @@ +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 ...n){ + String primes = ""; + for (int i: n){ + if (isPrime(i)){ + primes += (i + " "); + } + } + System.out.println(primes.trim()); + } + + public boolean isPrime(int prime){ + if (prime == 2){ + return true; + } + if (prime < 2){ + return false; + } + for (int i = 2; i <= prime / 2; i++){ + if (prime % i == 0){ + return false; + } + } + return true; + } +} + +public class Solution { + + public static void main(String[] args) { + try{ + BufferedReader br=new BufferedReader(new InputStreamReader(in)); + int n1=Integer.parseInt(br.readLine()); + int n2=Integer.parseInt(br.readLine()); + int n3=Integer.parseInt(br.readLine()); + int n4=Integer.parseInt(br.readLine()); + int n5=Integer.parseInt(br.readLine()); + Prime ob=new Prime(); + ob.checkPrime(n1); + ob.checkPrime(n1,n2); + ob.checkPrime(n1,n2,n3); + ob.checkPrime(n1,n2,n3,n4,n5); + Method[] methods=Prime.class.getDeclaredMethods(); + Set set=new HashSet<>(); + boolean overload=false; + for(int i=0;i