-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathPrime Checker.java
59 lines (57 loc) · 1.42 KB
/
Prime Checker.java
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
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{
boolean chk(int n){
if(n<2)return false;
for(int i=2;i*i<=n;i++)if(n%i==0)return false;
return true;
}
void checkPrime(Integer... a){
boolean f=false;
for(int i=0;i<a.length;i++){
if(chk(a[i])){
if(f)java.lang.System.out.print(" ");
f=true;
java.lang.System.out.print(a[i]);
}
}
java.lang.System.out.println();
}
}
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<String> set=new HashSet<>();
boolean overload=false;
for(int i=0;i<methods.length;i++){
if(set.contains(methods[i].getName())){
overload=true;
break;
}
set.add(methods[i].getName());
}
if(overload){
throw new Exception("Overloading not allowed");
}
}catch(Exception e){
System.out.println(e);
}
}
}