-
Notifications
You must be signed in to change notification settings - Fork 0
/
problem23.java
41 lines (37 loc) · 1009 Bytes
/
problem23.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
import java.util.*;
import static java.lang.System.out;
class problem23
{
public static void main (String [] args)
{
ArrayList<Integer> abNums = new ArrayList<Integer>();
for (int i = 1; i <= 28123; i++)
if(isAbundantNum(i)) abNums.add(i);
abNums.trimToSize();
ArrayList<Integer> nums = new ArrayList<Integer>();
for (int i = 0; i < 28123; i++) nums.add(i+1);
nums.trimToSize();
int stop = abNums.size();
for (int i = 0; i < stop; i++)
{
for(int j = 0; j < stop; j++)
{
Integer sum = abNums.get(i)+abNums.get(j);
if (nums.contains(sum)){ nums.remove(sum); }
}
}
int sum = 0;
for (int i = 0; i < nums.size(); i++)
sum+=nums.get(i);
out.println(sum);
}
private static boolean isAbundantNum (int x)
{
int sum = 0;
for (int i = 1; i <= x >> 1; i++)
{
if (x % i == 0) sum+=i;
}
return sum > x;
}
}