mirror of
https://github.com/jlengrand/project_euler.git
synced 2026-03-10 08:41:20 +00:00
d30505b12e
Gets all permutations, and choose one of those. Good solution could be to avoid the list and use an iterator Problem 26 seems though :s. Signed-off-by: Julien Lengrand-Lambert <julien@lengrand.fr>
27 lines
776 B
Python
27 lines
776 B
Python
#!/usr/bin/env python
|
|
"""
|
|
##---
|
|
# Julien Lengrand-Lambert
|
|
#Created on : Thu Jan 19 10:12:06 CET 2012
|
|
#
|
|
# DESCRIPTION : Solves problem 26 of Project Euler
|
|
A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
|
|
|
|
1/2 = 0.5
|
|
1/3 = 0.(3)
|
|
1/4 = 0.25
|
|
1/5 = 0.2
|
|
1/6 = 0.1(6)
|
|
1/7 = 0.(142857)
|
|
1/8 = 0.125
|
|
1/9 = 0.(1)
|
|
1/10 = 0.1
|
|
Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.
|
|
|
|
Find the value of d 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.
|
|
##---
|
|
"""
|
|
if __name__ == '__main__' :
|
|
print "Answer is : %d" %(l1)
|
|
raw_input() # USed to keep Windows terminal open
|