mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-07 14:19:31 +00:00
26 lines
707 B
Python
26 lines
707 B
Python
#-.- coding: latin-1 -.-
|
||
from __future__ import print_function
|
||
'''
|
||
Champernowne's constant
|
||
Problem 40
|
||
An irrational decimal fraction is created by concatenating the positive integers:
|
||
|
||
0.123456789101112131415161718192021...
|
||
|
||
It can be seen that the 12th digit of the fractional part is 1.
|
||
|
||
If dn represents the nth digit of the fractional part, find the value of the following expression.
|
||
|
||
d1 × d10 × d100 × d1000 × d10000 × d100000 × d1000000
|
||
'''
|
||
|
||
constant = []
|
||
i = 1
|
||
|
||
while len(constant) < 1e6:
|
||
constant.append(str(i))
|
||
i += 1
|
||
|
||
constant = ''.join(constant)
|
||
|
||
print(int(constant[0])*int(constant[9])*int(constant[99])*int(constant[999])*int(constant[9999])*int(constant[99999])*int(constant[999999])) |