def brute_force(self):
best = 0
for start in range(len(self.number)):
n = self.number[start:start + 13]
best = max(best, product(map(int, n)))
return best
def sequence_solution(self) -> float:
return product(self.get_n_champ(10 ** n) for n in range(7))
def test_non_iterable(self):
with pytest.raises(TypeError):
math.product(None)
def test_empty_sequence(self):
assert math.product([]) == 1
def test_non_iterable(self):
with T.assert_raises(TypeError):
math.product(None)
def test_empty_sequence(self):
T.assert_equal(math.product([]), 1)