You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
27 lines
701 B
27 lines
701 B
8 years ago
|
|
||
|
|
# 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
|