Project Euler & HackerRank problem 40 solution: Champernowne’s constant - solved using Python

Project-Euler-Problem-40.py

q = [9*(x+1) * pow(10, x) for x in range(20)]
def d(n):  # find the digit at position n in Champernowne's constant 
    i = 0
    while n>q[i]: n-= q[i]; i+= 1
    L, d = divmod((n-1), i+1)
    return int(str(pow(10, i)+L)[d])
n = input("Enter some indexes, separated by a space? ")
m = 1
for ci in map(int, n.split()):
    m*= d(ci)
print ("product =", m)