Java/Perfect.java at master · Akshen22/Java · 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

importjava.util.Scanner;

/*
 perfect Number between 1-N
*/
publicclassPerfect {
publicstaticvoidmain(String[] args) {
Scannerin = newScanner(System.in);
System.out.println("Enter the no. - ");
longn=in.nextInt();
inti;
for(i = 2; i < n; i++) {
if(isNumPerfect(i)) {
System.out.println(i + " is a perfect number");
 }
 }
in.close();
 }
publicstaticbooleanisNumPerfect(inti) {
booleanisPerfect = false;
intsum = 1;
intx;
for(x = 2; x <= i / 2; x++) {
if(i % x == 0) {
sum += x;
 }
 }
if(sum == i) {
isPerfect = true;
 }
returnisPerfect;
 }
}
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

importjava.util.Scanner;

/*
 perfect Number between 1-N
*/
publicclassPerfect {
publicstaticvoidmain(String[] args) {
Scannerin = newScanner(System.in);
System.out.println("Enter the no. - ");
longn=in.nextInt();
inti;
for(i = 2; i < n; i++) {
if(isNumPerfect(i)) {
System.out.println(i + " is a perfect number");
 }
 }
in.close();
 }
publicstaticbooleanisNumPerfect(inti) {
booleanisPerfect = false;
intsum = 1;
intx;
for(x = 2; x <= i / 2; x++) {
if(i % x == 0) {
sum += x;
 }
 }
if(sum == i) {
isPerfect = true;
 }
returnisPerfect;
 }
}
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

importjava.util.Scanner;

/*
 perfect Number between 1-N
*/
publicclassPerfect {
publicstaticvoidmain(String[] args) {
Scannerin = newScanner(System.in);
System.out.println("Enter the no. - ");
longn=in.nextInt();
inti;
for(i = 2; i < n; i++) {
if(isNumPerfect(i)) {
System.out.println(i + " is a perfect number");
 }
 }
in.close();
 }
publicstaticbooleanisNumPerfect(inti) {
booleanisPerfect = false;
intsum = 1;
intx;
for(x = 2; x <= i / 2; x++) {
if(i % x == 0) {
sum += x;
 }
 }
if(sum == i) {
isPerfect = true;
 }
returnisPerfect;
 }
}
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

importjava.util.Scanner;

/*
 perfect Number between 1-N
*/
publicclassPerfect {
publicstaticvoidmain(String[] args) {
Scannerin = newScanner(System.in);
System.out.println("Enter the no. - ");
longn=in.nextInt();
inti;
for(i = 2; i < n; i++) {
if(isNumPerfect(i)) {
System.out.println(i + " is a perfect number");
 }
 }
in.close();
 }
publicstaticbooleanisNumPerfect(inti) {
booleanisPerfect = false;
intsum = 1;
intx;
for(x = 2; x <= i / 2; x++) {
if(i % x == 0) {
sum += x;
 }
 }
if(sum == i) {
isPerfect = true;
 }
returnisPerfect;
 }
}
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

importjava.util.Scanner;

/*
 perfect Number between 1-N
*/
publicclassPerfect {
publicstaticvoidmain(String[] args) {
Scannerin = newScanner(System.in);
System.out.println("Enter the no. - ");
longn=in.nextInt();
inti;
for(i = 2; i < n; i++) {
if(isNumPerfect(i)) {
System.out.println(i + " is a perfect number");
 }
 }
in.close();
 }
publicstaticbooleanisNumPerfect(inti) {
booleanisPerfect = false;
intsum = 1;
intx;
for(x = 2; x <= i / 2; x++) {
if(i % x == 0) {
sum += x;
 }
 }
if(sum == i) {
isPerfect = true;
 }
returnisPerfect;
 }
}
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

importjava.util.Scanner;

/*
 perfect Number between 1-N
*/
publicclassPerfect {
publicstaticvoidmain(String[] args) {
Scannerin = newScanner(System.in);
System.out.println("Enter the no. - ");
longn=in.nextInt();
inti;
for(i = 2; i < n; i++) {
if(isNumPerfect(i)) {
System.out.println(i + " is a perfect number");
 }
 }
in.close();
 }
publicstaticbooleanisNumPerfect(inti) {
booleanisPerfect = false;
intsum = 1;
intx;
for(x = 2; x <= i / 2; x++) {
if(i % x == 0) {
sum += x;
 }
 }
if(sum == i) {
isPerfect = true;
 }
returnisPerfect;
 }
}
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

importjava.util.Scanner;

/*
 perfect Number between 1-N
*/
publicclassPerfect {
publicstaticvoidmain(String[] args) {
Scannerin = newScanner(System.in);
System.out.println("Enter the no. - ");
longn=in.nextInt();
inti;
for(i = 2; i < n; i++) {
if(isNumPerfect(i)) {
System.out.println(i + " is a perfect number");
 }
 }
in.close();
 }
publicstaticbooleanisNumPerfect(inti) {
booleanisPerfect = false;
intsum = 1;
intx;
for(x = 2; x <= i / 2; x++) {
if(i % x == 0) {
sum += x;
 }
 }
if(sum == i) {
isPerfect = true;
 }
returnisPerfect;
 }
}
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

importjava.util.Scanner;

/*
 perfect Number between 1-N
*/
publicclassPerfect {
publicstaticvoidmain(String[] args) {
Scannerin = newScanner(System.in);
System.out.println("Enter the no. - ");
longn=in.nextInt();
inti;
for(i = 2; i < n; i++) {
if(isNumPerfect(i)) {
System.out.println(i + " is a perfect number");
 }
 }
in.close();
 }
publicstaticbooleanisNumPerfect(inti) {
booleanisPerfect = false;
intsum = 1;
intx;
for(x = 2; x <= i / 2; x++) {
if(i % x == 0) {
sum += x;
 }
 }
if(sum == i) {
isPerfect = true;
 }
returnisPerfect;
 }
}