NamTech

# -59231 import Euler import time count_t = time.time() prime_list = [] for i in range(1000): if Euler.is_prime(i): prime_list.append(i) li = [] for i in prime_list: for j in prime_list: case1 = (i, j) case2 = (-i, j) case3 = (i, -j) case4 = (-i, -j) li.append(case1) li.append(case2) li.append(case3) li.append(case4) total = 0 maxi = 0 for i in li: count = 0 for n in range(1000): if Euler.is_prime(pow(n,2) + n * i[0] + i[1]): count += 1 else: if count > maxi: maxi = count total = i[0] * i[1] break print("Answer: {:d}".format(total)) print("Running Time: {:.02f}".format(time.time()-count_t))

import time count_t = time.time() def circ(num): d = 1 divided = [] while 1: (q, r) = (d // num, d % num) if d in divided: return len(divided[divided.index(d):]) else: divided.append(d) d = r * 10 def e26(): maxi = 0 max_length = 0 for i in range(1, 1001): l = circ(i) if max_length < l: maxi = i max_length = l return maxi total = e26() print("Answer: {:d}".format(total)) print("Running Time: {:.02f}".format(time.time()-count_t))

# 4782 import time count_t = time.time() i = 1 j = 1 total = 2 while len(str(j)) != 1000: total += 1 temp = i i = j j += temp print("Answer: {:d}".format(total)) print("Running Time: {:.02f}".format(time.time()-count_t))