projecteuler---->problem=23----Non-abundant sums

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.

翻译;

完全数，就是能表示成其小于自身的所有因数的和的正整数。例如，28可表示成1 + 2 + 4 + 7 + 14 = 28，故28是一个完全数。

一个正整数n，若其小于自身的所有因数的和小于n则n是不足数，若大于则n为充足数。

12是最小的充足数，1 + 2 + 3 + 4 + 6 = 16。能表示成两个充足数的和的最小正整数是24。经数学分析，可知任一超过28123的整数都能写成两个充足数的和。

请求出所有不能表示成两个充足数的和的正整数的和。

代码：

def getSum(a):
    s=0
    for i in range(1,a/2+1):
        if a%i==0:
            s+=i
    return s

a,count=[0 for i in range(28124)],0
b=[0 for i in range(28124)]
for i in range(1,28124):
    s=getSum(i)
    if (s>i):
        a[count]=i
        count+=1
print count
for i in range(0,count):
    for j in range(i,count):
        tmp=a[i]+a[j]
        if tmp<28124:
            b[tmp]=1

test=0
for i in range(1,28124):
    if b[i]==0:
        test+=i
print test