FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaProgramming/HackerRank/Fourty.java at patch-2 · subham500071430/JavaProgramming · GitHub
subham500071430
/
JavaProgramming
Public
forked from
karterhhgg/JavaProgramming
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaProgramming
/
HackerRank
/
Fourty.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
69 lines (62 loc) · 1.38 KB
Breadcrumbs
JavaProgramming
/
HackerRank
/
Fourty.java
Copy path
File metadata and controls
69 lines (62 loc) · 1.38 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package
HackerRank
;
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
n
:
numbers
) {
if
(
isPrime
(
n
)) {
System
.
out
.
print
(
n
+
" "
);
}
}
System
.
out
.
println
();
}
private
boolean
isPrime
(
int
n
) {
if
(
n
<=
1
)
return
false
;
for
(
int
i
=
2
;
i
*
i
<=
n
;
i
++) {
if
(
n
%
i
==
0
)
return
false
;
}
return
true
;
}
}
public
class
Fourty
{
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
);
}
}
}
Back
|
FazBrowse Home
|
New Git URL