-
Notifications
You must be signed in to change notification settings - Fork 0
/
0023.py
42 lines (32 loc) · 904 Bytes
/
0023.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
limit = 28124
def isAabundant(num):
divisorsOfNum = []
for i in range(1, num//2+1):
if num % i == 0:
divisorsOfNum.append(i)
if sum(divisorsOfNum) > num:
return True
else:
return False
def isSumAbundant(num):
for item1 in abundantNums:
if item1 < num:
for item2 in abundantNums:
if item2 < num:
if item1+item2 == num:
return True
elif item1+item2 > num:
break
return False
abundantNums = []
for i in range(1, limit):
if isAabundant(i):
abundantNums.append(i)
sumAbundantNum = []
for i in range(1, limit):
if isSumAbundant(i):
sumAbundantNum.append(i)
notSumAbundantNum = list(range(1, limit))
for item in sumAbundantNum:
notSumAbundantNum.remove(item)
print(sum(notSumAbundantNum))