NamTech

# 2783915460 import time import itertools count_t = time.time() li = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] perm = itertools.permutations(li) count = 0 total = "" for i in perm: count += 1 if count == 1000000: for j in i: total += str(j) break print("Answer: {:d}".format(int(total))) print("Running Time: {:.02f}".format(time.time()-count_t))

# 4179871 import Euler import time count_t = time.time() total = 0 abn = set() for i in range(1, 28123): if Euler.sum_of_divisor(i) > 2 * i: abn.add(i) if not any((i-a in abn) for a in abn): # ★ total += i print("Answer: {:d}".format(total)) print("Running Time: {:.02f}".format(time.time()-count_t))

# 871198282 import time from string import ascii_uppercase count_t = time.time() f = open('names.txt') names = f.read().split(',') names.sort() i = 0 total = 0 while i < len(names): result = 0 temp = names[i].strip('"') for j in temp: result += (ascii_uppercase.index(j) + 1) i += 1 total += (result * i) print("Answer: {:d}".format(total)) print("Running Time: {:.02f}".format(time.time()-count_t))