5 from typing import List
6 from heapq import heappush, heappop
11 self.lowers, self.highers = [], []
13 def add_number(self, number):
14 if not self.highers or number > self.highers[0]:
15 heappush(self.highers, number)
17 heappush(self.lowers, -number) # for lowers we need a max heap
21 if len(self.lowers) - len(self.highers) > 1:
22 heappush(self.highers, -heappop(self.lowers))
23 elif len(self.highers) - len(self.lowers) > 1:
24 heappush(self.lowers, -heappop(self.highers))
27 if len(self.lowers) == len(self.highers):
28 return (-self.lowers[0] + self.highers[0])/2
29 elif len(self.lowers) > len(self.highers):
30 return -self.lowers[0]
32 return self.highers[0]
35 def gcd_floats(a: float, b: float) -> float:
37 return gcd_floats(b, a)
42 return gcd_floats(b, a - math.floor(a / b) * b)
45 def gcd_float_sequence(lst: List[float]) -> float:
47 raise ValueError("Need at least one number")
51 gcd = gcd_floats(lst[0], lst[1])
52 for i in range(2, len(lst)):
53 gcd = gcd_floats(gcd, lst[i])
57 def truncate_float(n: float, decimals: int = 2):
58 """Truncate a float to a particular number of decimals."""
59 assert decimals > 0 and decimals < 10
60 multiplier = 10 ** decimals
61 return int(n * multiplier) / multiplier
64 @functools.lru_cache(maxsize=1024, typed=True)
65 def is_prime(n: int) -> bool:
66 """Returns True if n is prime and False otherwise"""
67 if not isinstance(n, int):
68 raise TypeError("argument passed to is_prime is not of 'int' type")
76 # This is checked so that we can skip middle five numbers in below
78 if (n % 2 == 0 or n % 3 == 0):
83 if (n % i == 0 or n % (i + 2) == 0):