Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
3 guesses max: divisor with max futures remainders to divide possibilities solution in Clear category for Number Guess by Phil15
def checkio(attempts):
numbers = set.intersection(*(set(range(remainder, 101, divisor))
for remainder, divisor in attempts)) - {0}
return max(
set(range(2, 11)) - {divisor for _, divisor in attempts},
key=lambda divisor: len({n % divisor for n in numbers}),
), min(numbers)
April 15, 2020
Comments: