-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathProblem21.java
executable file
·62 lines (43 loc) · 1.11 KB
/
Problem21.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
60
61
62
import java.util.*;
import java.io.File;
import java.io.IOException;
import java.math.BigInteger;
public class helloworld {
public static void main(String []args)
throws IOException {
//System.out.println("Hello World");
System.out.println("Answer: " + AmicableNumbers(10000));
}
public static int AmicableNumbers(int num) {
int[] array = new int[num];
Vector<Integer> v = new Vector<Integer>();
int currentSum = 0;
int otherSum = 0;
int sum = 0;
for (int i = 2; i < num; i++) {
//int i = 220;
currentSum = SumOfDivisors(i);
if (currentSum >= num)
continue;
otherSum = SumOfDivisors(currentSum);
/*v.add(i, new Integer(currentSum));
if (v.elementAt(currentSum) == 0) {
v.add(currentSum, new Integer(SumOfDivisors(currentSum)));
}*/
if (otherSum == i && i != currentSum) {
System.out.println(i + " " + currentSum);
sum += i;
}
}
return sum;
}
public static int SumOfDivisors(int num) {
int sum = 0;
for (int i = num - 1; i > 0; i--) {
if (num % i == 0) {
sum += i;
}
}
return sum;
}
}