def solve(): concatenated_ints = '' n = 0 while len(concatenated_ints) <= 1000000: concatenated_ints += str(n) n += 1 return prod(int(concatenated_ints[10 ** i]) for i in range(7))
def solve(): concatenated_ints = '' n = 0 while len(concatenated_ints) <= 1000000: concatenated_ints += str(n) n += 1 return prod(int(concatenated_ints[10**i]) for i in range(7))
def solve(): fractions = ( Fraction(a, b) for a in range(10, 100) for b in range(a + 1, 100) # non trivial if b % 10 != 0 # can be incorrectly simplified if a % 10 == b // 10 # incorrectly simplified == correctly simplified if a / b == (a // 10) / (b % 10)) return prod(fractions).denominator
def product(digits): return prod(map(int, digits))