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 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?
You can find the algorithm to solve this challenge inside challenge.cpp.
Click here to see the result!
Result is: 2,783,915,460