problems.py

import string
import time

from calculations import custom_pow


def problem16():
    result = 0
    target = custom_pow(2, 1000)
    nums = [int(i) for i in str(target)]
    for num in nums:
        print(num)
        result += num
    return result


def problem17():
    insertion = 'and'
    base = ['', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine']
    misc = ['ten', 'eleven', 'twelve', 'thirteen', 'fourteen', 'fifteen', 'sixteen', 'seventeen', 'eighteen',
            'nineteen']
    decimals = ['twenty', 'thirty', 'forty', 'fifty', 'sixty', 'seventy', 'eighty', 'ninety']
    hundred = 'hundred'
    thousand = 'thousand'
    result = ''
    for i in range(1, 1001):
        array = [int(j) for j in str(i)]
        if len(array) == 1:
            result += str(base[i])
        if len(array) == 2:
            if array[0] == 1:
                result += str(misc[array[1]])
            else:
                result += str(decimals[array[0] - 2] + base[array[1]])
        if len(array) == 3:
            if array[1] == 0:
                if array[2] == 0:
                    result += str(base[array[0]] + hundred)
                else:
                    result += str(base[array[0]] + hundred + insertion + base[array[2]])
            elif array[1] == 1:
                result += str(base[array[0]] + hundred + insertion + misc[array[2]])
            else:
                result += str(base[array[0]] + hundred + insertion + decimals[array[1] - 2] + base[array[2]])
        if len(array) == 4:
            result += 'onethousand'
    print(len(result))


## TODO Fix some recursive exception
def problem18():
    global high
    triangle = open('resources/problem67.txt')
    contents = triangle.readlines()
    triangle = []
    for i in contents:
        array = i.split()
        result = map(int, array)
        triangle.append(list(result))
    triangle = triangle[::-1]

    def getHighestValues(newtriangle):
        global high
        for idx, row in enumerate(newtriangle[1:]):
            temp = []
            for idy, number in enumerate(row):
                value1 = number + triangle[idx][idy]
                value2 = number + triangle[idx][idy + 1]
                temp.append(max(value1, value2))
            del triangle[idx]
            del triangle[idx]
            triangle.insert(0, temp)
            if len(triangle) == 1:
                high = triangle[0][0]
            getHighestValues(triangle)

    try:
        getHighestValues(triangle)
    # TODO fix indexerror, if thrown the algorithm is done
    except IndexError:
        return high


def problem20(target):
    temp = 1
    result = 0
    for i in range(target, 0, -1):
        temp *= i
    for i in str(temp):
        result += int(i)
    return result


def problem21(taregetnum):
    temp = 0
    amicables = []
    dict = {}  # {SUM, NUMBER}
    currentnums = []
    for i in range(1, taregetnum, 1):
        for j in range(1, i, 1):
            if i % j == 0:
                currentnums.append(j)
        for k in currentnums:
            temp += k
        if temp in dict and dict[temp] == i:
            amicables.append(i)
            amicables.append(temp)
        dict[i] = temp
        currentnums.clear()
        temp = 0
    result = 0
    for i in amicables:
        print(i)
        result += i
    return result


def problem22():
    valueofnames = 0
    value = 0
    alphabet = dict(zip(string.ascii_lowercase, range(1, 27)))
    names = open("resources/problem22.txt", "r")
    lines = names.readline()
    refactor = lines.replace('"', '').split(",")
    refactor.sort()
    for name in refactor:
        for char in name:
            value += alphabet[char.lower()]
        valueofnames += (1 + refactor.index(name)) * value
        value = 0
    return valueofnames


def problem23():
    nums = list(range(1, 28123))
    abundants = []
    sums = []
    result = 0
    # Abundant num = sum of proper divisors > n
    for i in range(28123):
        if i not in abundants:
            divisors = []
            for j in range(1, i - 1):
                # Check for perfect divisor
                if i % j == 0:
                    divisors.append(j)
            temp = 0
            # Look for the sum of all divisors
            for divisor in divisors:
                temp += divisor
            divisors.clear()
            # proper divisors > n
            if temp > i:
                # Abundant!
                abundants.append(i)
                # Find all new abundant numbers that are multiples
                for newab in range(i, 28123, i):
                    if newab not in abundants:
                        # Add newfound abundant number
                        abundants.append(newab)

    # Loop through all abundant nums
    for x in abundants:
        print(f"looping @ {x}")
        for y in abundants:
            # Remove any new combination of abundant numbers
            if x+y in nums:
                nums.remove(x+y)
        abundants.remove(x)
    # Numbers that are NOT the sum of an abundant number
    for num in nums:
        result += num
    return result