2.71828

https://projecteuler.net/problem=7 import time import math time_start = time.time() def prime_check(n): if n==2: return True for i in range(2, math.floor(math.sqrt(n))+1): if n%i==0: return False return True prime_list = [] n = 2 while (len(prime_list)

https://projecteuler.net/problem=1 import time sum = 0 time_start = time.time() for i in range(1, 1000): if i%3 == 0 or i%5 == 0: sum += i time_end = time.time() print(sum) print(time_end-time_start) # sum : 233168 ※ https://projecteuler.net/problem=2 import time time_start = time.time() sum = 0 fib_1 = 1 fib_2 = 1 while fib_2