Remove main call because they can't run standalone anymore

python/src/p0000_template.py

@@ -11,7 +11,3 @@
 
 def main() -> int:
     return 0
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0001.py

@@ -25,7 +25,3 @@ def summation(up_to: int, factor: int) -> int:
 
 def main() -> int:
     return summation(999, 3) + summation(999, 5) - summation(999, 15)
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0002.py

@@ -35,7 +35,3 @@ def main() -> int:
         answer += val
         val = next(f)
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0003.py

@@ -32,7 +32,3 @@
 
 def main() -> int:
     return max(prime_factors(600851475143))
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0004.py

@@ -29,7 +29,3 @@ def main() -> int:
         if num > result and is_palindrome(num):
             result = num
     return result
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0005.py

@@ -27,7 +27,3 @@ def main() -> int:
             if num < answer and all(num % divisor == 0 for divisor in group):
                 answer = num
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0006.py

@@ -24,7 +24,3 @@ def main() -> int:
     sum_of_squares = sum(x**2 for x in group)
     square_of_sum = sum(group)**2
     return square_of_sum - sum_of_squares
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0007.py

@@ -42,7 +42,3 @@ def main() -> int:
         if idx == 10001:
             return num
     return -1  # pragma: no cover
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0008.py

@@ -74,7 +74,3 @@ def main() -> int:
         num = reduce(mul, operands, 1)
         answer = max(answer, num)
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0009.py

@@ -33,7 +33,3 @@ def main() -> int:
         if sum(triple) == 1000:
             return reduce(mul, triple, 1)
     return -1  # pragma: no cover
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0010.py

@@ -29,7 +29,3 @@
 
 def main() -> int:
     return sum(takewhile((2_000_000).__gt__, primes()))
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0011.py

@@ -107,7 +107,3 @@ def main() -> int:
         if product > answer:
             answer = product
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0012.py

@@ -41,7 +41,3 @@ def main() -> int:
         if sum(1 for _ in proper_divisors(num)) > 500:
             return num
     return -1  # pragma: no cover
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0013.py

@@ -213,7 +213,3 @@ def main() -> int:
         53503534226472524250874054075591789781264330331690
     )
     return int(repr(sum(numbers))[:10])
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0014.py

@@ -47,7 +47,3 @@ def main() -> int:
     return max(
         (collatz_len(x, cache), x) for x in range(1, 1000000)
     )[1]
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0015.py

@@ -20,7 +20,3 @@
 
 def main() -> int:
     return lattice_paths(20, 20)
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0016.py

@@ -13,7 +13,3 @@
 
 def main() -> int:
     return sum(int(x) for x in repr(2**1000))
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0017.py

@@ -76,7 +76,3 @@ def main() -> int:
         string = to_string(x)
         answer += len(string.replace(" ", "").replace("-", ""))
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0018.py

@@ -64,7 +64,3 @@ def main() -> int:
         (4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23)
     )
     return reduce_triangle(rows)
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0019.py

@@ -35,7 +35,3 @@ def monthly_iterator(years: range, months: range = range(1, 13), day: int = 1) -
 
 def main() -> int:
     return sum(1 for _ in monthly_iterator(years=range(1901, 2001)))
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0020.py

@@ -18,7 +18,3 @@
 
 def main() -> int:
     return sum(int(x) for x in repr(factorial(100)))
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0021.py

@@ -40,7 +40,3 @@ def main() -> int:
             ret += a + b
             skip.add(b)
     return ret
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0022.py

@@ -28,7 +28,3 @@ def score(name: str, idx: int) -> int:
 def main() -> int:
     names = sorted(get_data_file('p0022_names.txt').upper().replace('"', '').split(','))
     return sum(score(name, idx) for idx, name in enumerate(names, 1))
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0023.py

@@ -34,7 +34,3 @@ def main() -> int:
     for x, y in combinations_with_replacement(abundants(stop=28112), 2):
         abundant_sums.add(x + y)
     return sum(filterfalse(abundant_sums.__contains__, range(1, 28124)))
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0024.py

@@ -23,7 +23,3 @@ def main() -> int:
         if idx == 999999:
             return int("".join(repr(i) for i in x))
     return -1  # pragma: no cover
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0025.py

@@ -38,7 +38,3 @@ def main() -> int:
         if x > check:
             return idx
     return -1  # pragma: no cover
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0027.py

@@ -44,7 +44,3 @@ def main() -> int:
                 streak = test
                 answer = a * b
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0028.py

@@ -63,7 +63,3 @@ def spiral_diagonal_sum(size: int) -> int:
 
 def main() -> int:
     return spiral_diagonal_sum(1001)
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0029.py

@@ -25,7 +25,3 @@
 def main() -> int:
     space = range(2, 101)
     return len(set(a**b for a in space for b in space))
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0030.py

@@ -28,7 +28,3 @@ def main() -> int:
         if x == sum(int(y)**5 for y in repr(x)):
             ret += x
     return ret
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0031.py

@@ -50,7 +50,3 @@ def main() -> int:
     units = (200, 100, 50, 20, 10, 5, 2, 1)
     counts = [0 for _ in units]
     return coin_combinations(200, units, counts)
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0032.py

@@ -39,7 +39,3 @@ def main() -> int:
                 answer += product
                 break
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0033.py

@@ -39,7 +39,3 @@ def main() -> int:
                         answer *= frac
                         counter += 1
     return answer.denominator
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0034.py

@@ -23,7 +23,3 @@ def main() -> int:
         if sum(factorial(int(y)) for y in repr(x)) == x:
             answer += x
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0035.py

@@ -32,7 +32,3 @@ def main() -> int:
         if all(is_prime(r) for r in rotations(x)):
             answer += 1
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0036.py

@@ -27,7 +27,3 @@ def main() -> int:
         if is_palindrome(x) and is_palindrome(x, rep_func=bin_repr):
             answer += x
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0037.py

@@ -38,10 +38,7 @@ def main() -> int:
                 left %= x // 10
             if left != 0:
                 continue
+            print(p)
             answer += p
             count += 1
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0038.py

@@ -43,7 +43,3 @@ def main() -> int:
                 break
             cur_digits = cur_digits + tuple(digits(x * num))[::-1]
     return reduce(lambda x, y: x * 10 + y, answer)
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0039.py

@@ -29,7 +29,3 @@ def main() -> int:
             biggest_size = num_solutions
             biggest = p
     return biggest
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0040.py

@@ -32,7 +32,3 @@ def main() -> int:
                     return reduce(mul, queries, 1)
         digits_seen += digits
     return -1  # pragma: no cover
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0041.py

@@ -32,7 +32,3 @@ def main() -> int:
         elif p > answer:
             answer = p
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0042.py

@@ -33,7 +33,3 @@ def main() -> int:
         if n in cache:
             answer += 1
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0043.py

@@ -43,7 +43,3 @@ def main() -> int:
         else:
             answer += from_digits(d)
     return answer
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0044.py

@@ -38,7 +38,3 @@ def main() -> int:
             if is_pentagonal(j + k) and is_pentagonal(k - j):
                 D = min((D, abs(k - j)))
     return D
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0045.py

@@ -45,7 +45,3 @@ def main() -> int:
             H_idx += 1
             H_val = H(H_idx)
     return T_val
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0046.py

@@ -45,7 +45,3 @@ def main() -> int:
         else:
             return goal
     return -1  # pragma: no cover
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0047.py

@@ -46,7 +46,3 @@ def main() -> int:
         if all(cached_is_prime((x, 4, True), cache) for x in group):
             return group[0]
     return -1  # pragma: no cover
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0048.py

@@ -12,7 +12,3 @@
 def main() -> int:
     ten_ten = 10**10
     return sum(pow(x, x, ten_ten) for x in range(1, 1001)) % ten_ten
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover

python/src/p0049.py

@@ -41,7 +41,3 @@ def main() -> int:
                 elif set(digits(p1)) == set(digits(p2)) == set(digits(p3)):
                     return p1 * 10**8 + p2 * 10**4 + p3
     return -1  # pragma: no cover
-
-
-if __name__ == '__main__':
-    print(main())  # pragma: no cover