Corrected a few C'isms and also added the solutions to four more problems

This commit is contained in:
MitchellHansen
2017-03-13 22:53:00 -07:00
parent 10b76d0ca6
commit 44358923e3
11 changed files with 183 additions and 7 deletions

26
problem_24.py Normal file
View File

@@ -0,0 +1,26 @@
# A permutation is an ordered arrangement of objects.
# For example, 3124 is one possible permutation of the
# digits 1, 2, 3 and 4. If all of the permutations are
# listed numerically or alphabetically, we call it
# lexicographic order. The lexicographic permutations of 0, 1 and 2 are:
#
# 012 021 102 120 201 210
#
# What is the millionth lexicographic permutation of the digits
# 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
# learned about itertools from problem 23. Python is wonderful
import itertools
list = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
uniquelist = set(list)
iter = 0
for n in itertools.permutations(uniquelist, 10):
iter += 1
if iter == 1000000:
print(n)
break