"""
Project Euler 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 whose proper divisors are less than the number is called
deficient and a number whose proper divisors exceed the number is called
abundant.

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.
"""
import euler_utils as utils

divisor_sum = lambda number:sum(utils.divisors_of(number))

abundant_numbers = []

for i in range(12, 28124):
  if divisor_sum(i) > i:
    abundant_numbers.append(i)


abundant_set = set(abundant_numbers)

total = sum([x for x in range(24)]) #+ sum([x for x in range(25, 28124,2)])

for num in range(25, 28124, 1):
  index = 0
  isSum = False
  while abundant_numbers[index] < num:
    if (num - abundant_numbers[index]) in abundant_set:
      isSum = True
      break
    index += 1
  if not isSum:
    total += num

print total
