FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java-Programs/Basic-Programs/AdamNum.java at master · githubanalyzeruser/Java-Programs · GitHub
githubanalyzeruser
/
Java-Programs
Public
forked from
divScorp/Java-Programs
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
Java-Programs
/
Basic-Programs
/
AdamNum.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
50 lines (42 loc) · 909 Bytes
Breadcrumbs
Java-Programs
/
Basic-Programs
/
AdamNum.java
Copy path
File metadata and controls
50 lines (42 loc) · 909 Bytes
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
/*
* lets num=12;
* now, square of 12=144
* reverse of 12 = 21
* square of 21= 441
* 144=rev(441)
*
* So, the number 12 is a adam number
*
* */
import
java
.
util
.
Scanner
;
public
class
AdamNum
{
static
int
revDigit
(
int
num
) {
int
rev
=
0
;
while
(
num
>
0
) {
rev
=
rev
*
10
+
num
%
10
;
num
/=
10
;
}
return
rev
;
}
static
int
square
(
int
n
) {
return
n
*
n
;
}
static
boolean
checkAdam
(
int
num
) {
int
a
=
square
(
num
);
System
.
out
.
println
(
"Number square: "
+
a
);
int
b
=
square
(
revDigit
(
num
));
System
.
out
.
println
(
"Reverse Number Square: "
+
b
);
return
(
a
==
revDigit
(
b
));
}
public
static
void
main
(
String
[]
args
) {
Scanner
sc
=
new
Scanner
(
System
.
in
);
System
.
out
.
println
(
"Enter the Number: "
);
int
n
=
sc
.
nextInt
();
if
(
checkAdam
(
n
)) {
System
.
out
.
println
(
"Adam Number! "
);
}
else
{
System
.
out
.
println
(
"Not a Adam Number! "
);
}
sc
.
close
();
}
}
Back
|
FazBrowse Home
|
New Git URL