From 5af26928160ad21d3e01d2d0734daa9b441c9a41 Mon Sep 17 00:00:00 2001 From: daviddoji Date: Sun, 19 Dec 2021 19:38:47 +0100 Subject: [PATCH] Remove file --- src/Python/Problems001-050/utils.py | 48 ----------------------------- 1 file changed, 48 deletions(-) delete mode 100644 src/Python/Problems001-050/utils.py diff --git a/src/Python/Problems001-050/utils.py b/src/Python/Problems001-050/utils.py deleted file mode 100644 index 6d70861..0000000 --- a/src/Python/Problems001-050/utils.py +++ /dev/null @@ -1,48 +0,0 @@ -import math -from functools import wraps - - -def timeit(name): - def profile(original): - import time - @wraps(original) - def wrapper(*args, **kwargs): - t0 = time.perf_counter() - result = original(*args, **kwargs) - t1 = time.perf_counter() - print(f"Time to evaluate problem {int(name[7:]):003d}: {(t1 - t0)*1000:.3f} ms\n") - return result - return wrapper - return profile - - -def is_prime(n): - if n <2: - return False - for i in range(2, int(math.sqrt(n)) + 1): - if n % i == 0: - return False - return True - - -# Returns a list of True and False indicating whether each number is prime. -# For 0 <= i <= n, result[i] is True if i is a prime number, False otherwise. -def list_primality(n): - # Sieve of Eratosthenes - result = [True] * (n + 1) - result[0] = result[1] = False - for i in range(int(math.sqrt(n) + 1)): - if result[i]: - for j in range(i * i, len(result), i): - result[j] = False - return result - - -# Returns all the prime numbers less than or equal to n, in ascending order -# For example: list_primes(97) = [2, 3, 5, 7, 11, ..., 83, 89, 97]. -def list_primes(n): - return [i for (i, is_prime) in enumerate(list_primality(n)) if is_prime] - - -def is_palindrome(num): - return str(num) == str(num)[::-1] \ No newline at end of file