Non-abundant sums

https://projecteuler.net/problem=23

Non-abundant sums

Problem 23

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.

没有用特别的方法，从小到大算了一遍，耗时比较长。

def sumNonAbunCalc():
    #保存满足要求的数值集合
    abundantList = set()
    #保存结果
    result = 0
    for i in range(1,28124):
        if isAbundant(i):
            #将满足要求的值加进去
            abundantList.add(i)
        if not isAbundantSum(i,abundantList):
            #如果不能达到要求，则将其加到结果中去
            result += i

    return result

from math import sqrt
def isAbundant(num):
    #因子和，默认1加进去了
    sumFactor = 1
    end = int(sqrt(num))
    #求所有因子的和
    for i in range(2,end+1):
        if num % i == 0:
            sumFactor = sumFactor + i + num / i
    #避免能平方的数加重了
    if end * end == num:
        sumFactor -= end
    if sumFactor > num :
        return True
    else:
        return False

def isAbundantSum(num,numList):
    #遍历一遍，看能不能达到要求
    if len(numList) == 0:return False
    for i in numList:
        if num - i in numList:
            return True
    return False

print(sumNonAbunCalc())