-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPerfectNumber.java
More file actions
39 lines (38 loc) · 898 Bytes
/
Copy pathPerfectNumber.java
File metadata and controls
39 lines (38 loc) · 898 Bytes
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
import java.io.*;
import java.util.*;
public class Code {
public static int sum_of_divisors1(int num){
int d_sum = 1;
for(int n = 2; n <= num; n++){
if(num % n == 0){
d_sum += n;
}
}
return d_sum;
}
public static int sum_of_divisors2(int num){
int d_sum = 1;
int n = 2;
while(n * n < num){
if(num % n == 0){
d_sum += n;
d_sum += num/n;
}
n++;
}
if(n * n == num)
d_sum += n;
return d_sum;
}
public static void main(String[] args) {
int n = 28;
int sum_d = sum_of_divisors2(n);
if(sum_d == n){
System.out.println("Perfect Number");
}else if(sum_d > n){
System.out.println("Abundant Number");
}else{
System.out.println("Deficient Number");
}
}
}