hackerrank/java/HackerrankJava0063.java at master · mcakar-dev/hackerrank · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
importjava.io.BufferedReader;
importjava.io.InputStreamReader;
importjava.lang.reflect.Method;
importjava.util.HashSet;
importjava.util.Set;

publicclassHackerrankJava0063 {

publicstaticvoidmain(String[] args) throwsException {
// Prime Checker
// https://www.hackerrank.com/challenges/prime-checker/problem?isFullScreen=true

try {
BufferedReaderbr = newBufferedReader(newInputStreamReader(System.in));
intn1 = Integer.parseInt(br.readLine());
intn2 = Integer.parseInt(br.readLine());
intn3 = Integer.parseInt(br.readLine());
intn4 = Integer.parseInt(br.readLine());
intn5 = Integer.parseInt(br.readLine());
Primeob = newPrime();
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<String> set = newHashSet<>();
booleanoverload = false;
for (inti = 0; i < methods.length; i++) {
if (set.contains(methods[i].getName())) {
overload = true;
break;
 }
set.add(methods[i].getName());

 }
if (overload) {
thrownewException("Overloading not allowed");
 }
 } catch (Exceptione) {
System.out.println(e);
 }
	}

}

// -------------------------------------------------------------------------------------------------
// --- You need to add this lines for solution hackerrank provides all other lines for challange ---
// -------------------------------------------------------------------------------------------------
classPrime {

publicvoidcheckPrime(int... numbersToCheck) {
for (intnumber : numbersToCheck) {
if (isPrime(number)) {
System.out.print(number + " ");
 }
 }
System.out.println();
	}

privatebooleanisPrime(intvalue) {
if (value < 2) {
returnfalse;
 }
for (inti = 2; i <= Math.sqrt(value); i++) {
if (value % i == 0) {
returnfalse;
 }
 }
returntrue;
	}
}

// -------------------------------------------------------------------------------------------------
// -------------------------------------------------------------------------------------------------
// -------------------------------------------------------------------------------------------------