mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-30 16:31:08 +00:00
Solution to Problem 40
This commit is contained in:
parent
9ed60ba882
commit
6a8f1cf232
26
Project Euler/Problem 40/sol1.py
Normal file
26
Project Euler/Problem 40/sol1.py
Normal file
|
@ -0,0 +1,26 @@
|
|||
#-.- 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]))
|
Loading…
Reference in New Issue
Block a user