package xxx.xxx.xxx;
import java.util.HashSet;
/*
* A perfect number is a number for which the sum of its proper divisors is exactly equal to the number.
* For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.
* A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.
* As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24.
* By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers.
* However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.
* Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
*/
public class NonAbundantSums1 {
HashSet<Integer> AbundantsHS = new HashSet<Integer>();
public NonAbundantSums1(int supremum) {
this.getAbundants(supremum);
}
private void compute(int supremum) {
int sum = 0;
for (int i = 1; i < supremum; i++) {
boolean isSumOf2Abundants = false;
label:
for(int j = 1; j<i; j++){
if(AbundantsHS.contains(j)&&AbundantsHS.contains(i-j)){
isSumOf2Abundants = true;
break label;
}
}
if(!isSumOf2Abundants){
sum+=i;
}
}
System.out.println(sum);
}
private void getAbundants(int supremum) {
for (int number = 1; number < supremum; number++) {
int divisorsSum = 0;
for (int i = 1; i <= number/2; i++) {
if (number % i == 0) {
divisorsSum += i;
}
}
if (divisorsSum > number) {
AbundantsHS.add(number);
}
}
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
long startTime = System.currentTimeMillis();
NonAbundantSums1 n = new NonAbundantSums1(28123);
n.compute(28123);
long endTime = System.currentTimeMillis();
System.out.println("execution time "+(endTime-startTime +"ms"));
}
}
import java.util.HashSet;
/*
* A perfect number is a number for which the sum of its proper divisors is exactly equal to the number.
* For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.
* A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.
* As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24.
* By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers.
* However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.
* Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
*/
public class NonAbundantSums1 {
HashSet<Integer> AbundantsHS = new HashSet<Integer>();
public NonAbundantSums1(int supremum) {
this.getAbundants(supremum);
}
private void compute(int supremum) {
int sum = 0;
for (int i = 1; i < supremum; i++) {
boolean isSumOf2Abundants = false;
label:
for(int j = 1; j<i; j++){
if(AbundantsHS.contains(j)&&AbundantsHS.contains(i-j)){
isSumOf2Abundants = true;
break label;
}
}
if(!isSumOf2Abundants){
sum+=i;
}
}
System.out.println(sum);
}
private void getAbundants(int supremum) {
for (int number = 1; number < supremum; number++) {
int divisorsSum = 0;
for (int i = 1; i <= number/2; i++) {
if (number % i == 0) {
divisorsSum += i;
}
}
if (divisorsSum > number) {
AbundantsHS.add(number);
}
}
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
long startTime = System.currentTimeMillis();
NonAbundantSums1 n = new NonAbundantSums1(28123);
n.compute(28123);
long endTime = System.currentTimeMillis();
System.out.println("execution time "+(endTime-startTime +"ms"));
}
}