4 from typing import List
5 from heapq import heappush, heappop
10 self.lowers, self.highers = [], []
12 def add_number(self, number):
13 if not self.highers or number > self.highers[0]:
14 heappush(self.highers, number)
16 heappush(self.lowers, -number) # for lowers we need a max heap
20 if len(self.lowers) - len(self.highers) > 1:
21 heappush(self.highers, -heappop(self.lowers))
22 elif len(self.highers) - len(self.lowers) > 1:
23 heappush(self.lowers, -heappop(self.highers))
26 if len(self.lowers) == len(self.highers):
27 return (-self.lowers[0] + self.highers[0])/2
28 elif len(self.lowers) > len(self.highers):
29 return -self.lowers[0]
31 return self.highers[0]
34 def gcd_floats(a: float, b: float) -> float:
36 return gcd_floats(b, a)
41 return gcd_floats(b, a - math.floor(a / b) * b)
44 def gcd_float_sequence(lst: List[float]) -> float:
46 raise ValueError("Need at least one number")
50 gcd = gcd_floats(lst[0], lst[1])
51 for i in range(2, len(lst)):
52 gcd = gcd_floats(gcd, lst[i])
56 def truncate_float(n: float, decimals: int = 2):
57 """Truncate a float to a particular number of decimals."""
58 assert decimals > 0 and decimals < 10
59 multiplier = 10 ** decimals
60 return int(n * multiplier) / multiplier
63 def is_prime(n: int) -> bool:
64 """Returns True if n is prime and False otherwise"""
65 if not isinstance(n, int):
66 raise TypeError("argument passed to is_prime is not of 'int' type")
74 # This is checked so that we can skip middle five numbers in below
76 if (n % 2 == 0 or n % 3 == 0):
81 if (n % i == 0 or n % (i + 2) == 0):