Package net.n1da.dev.euler
Class PE0023
- java.lang.Object
-
- net.n1da.dev.euler.core.Problem
-
- net.n1da.dev.euler.PE0023
-
- All Implemented Interfaces:
Solvable
public class PE0023 extends Problem
Solution for problem 23 "Non-abundant sums" completed on Mon, 25 May 2015, 13:46.- Since:
- 25.05.2015 07:01:03
- Author:
- Nico Danneberg
- See Also:
- Problem @ Project Euler, Solution @ Ni-Da-Net
-
-
Field Summary
Fields Modifier and Type Field Description private java.util.ArrayList<java.lang.Integer>
AbundantNumbers
Stores all found abundant numbers.private int[]
AbundantSums
Storage for all sums.
-
Method Summary
Modifier and Type Method Description void
prepare()
Just initializesAbundantNumbers
andAbundantSums
.java.lang.String
solve()
This method solves the given problem by checking every number inAbundantSums
if it is an abundant number.-
Methods inherited from class net.n1da.dev.euler.core.Problem
finish, getResult, getRuntime, toString
-
-
-
-
Method Detail
-
prepare
public void prepare()
Just initializesAbundantNumbers
andAbundantSums
.
-
solve
public java.lang.String solve()
This method solves the given problem by checking every number inAbundantSums
if it is an abundant number. If it is one it is added to all other found abundant numbers. The result is stored, so it can be summed up finally.- Returns:
- the sum of of all abundant number sums
- See Also:
Mathe.isAbundantNumber(int)
-
-