def main(): """Main entry point for the script""" start = time.time() # please see http://copingwithcomputers.com/2013/07/06/lattice-paths/ # for an explanation on the relation of lattice paths with Pascal numbers print(combinations_n_k(40, 20)) timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() a = 0 with open('problem13-data.txt') as f: for line in f: b = int(line.strip()) a += b print(str(a)[:10]) timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() # short explanation: # str(number) - converts number to string # map(int, string) - converts each character to int # sum(list) - sums the list of ints (in this case) print(sum(map(int, str(int(math.pow(2, 1000)))))) timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() triangular_number = 1 n = 2 while number_of_factors(triangular_number) <= 500: triangular_number += n n += 1 timeutils.elapsed_time(time.time() - start) print(triangular_number)
def main(): """Main entry point for the script""" start = time.time() number = 1000 while number >= 1: count_words(number) number -= 1 # uncomment next line to view the string # print(string) # spaces don't count print(len(string.replace(" ", ""))) timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() longest_length = 0 longest_number = 0 number = 1000000 while number > 1: collatz_sequence_length = len(collatz_sequence(number)) if collatz_sequence_length > longest_length: longest_length = collatz_sequence_length longest_number = number number -= 1 print(longest_number) timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() # create a matrix from the problem data matrix = fill_matrix() # compute the largest value from the matrix on a horizontal traversal value_horizontally = largest_product_horizontally(matrix) print("horizontally: " + str(value_horizontally)) # compute the largest value from the matrix on a vertical traversal value_vertically = largest_product_vertically(matrix) print("vertically: " + str(value_vertically)) # compute the largest value from the matrix on a diagonal traversal value_diagonally = largest_product_diagonally(matrix) print("diagonally: " + str(value_diagonally)) print("largest product found is: " + str(max(value_horizontally, value_vertically, value_diagonally))) timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for script""" start = time.time() ten_thousand_first_prime() timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() largest_palindrome() timeutils.elapsed_time(time.time() - start)
def main(): start = time.time() print("test") timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() pythagorean_triplet() timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() sum_square_less_square_sum() timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() evenly_divide_from_1_to_20() timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() sum_of_primes() timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() sum_fibonacci() timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() # print the last value of the sorted list print(factors(600851475143)[-1]) timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() greatest_product(a_thousand_digit_number) timeutils.elapsed_time(time.time() - start)
def main(): """Main entry point for the script""" start = time.time() print(sum_numbers()) timeutils.elapsed_time(time.time() - start)