EulerProject/Problem_23.py at master · seoruosa/EulerProject · GitHub

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
43
from Problem_21 import proper_divisors
from Problem_12 import divisors

LIMIT = 28123

def abundant_list(n):
    return [i for i in range(1, n+1) if sum(proper_divisors(i))>i]

# array is ordered
def sum_on_list(n, array):
    low, high = (0, len(array)-1)

    while low <= high:
        if n == array[low] + array[high]:
            return (array[low], array[high])

        if array[low] + array[high] < n:
            low += 1
        else:
            high -= 1
    return None


def main():

    abundants = abundant_list(LIMIT)
    # abundants = [12]

    # for i in abundants:
    #     print(f"{i} {proper_divisors(i)} {divisors(i)} -> {sum(proper_divisors(i))}")

    # print(abundants)

    # print([i for i in abundants if i%2!=0])

    # print(sum_on_list(5, [1,3,5,8]))
    non_abundant_sum = [i for i in range(1, LIMIT+1) if sum_on_list(i, abundants) == None]

    print(non_abundant_sum)
    print(f"\n\n{sum(non_abundant_sum)}")

if __name__== '__main__':
    main()