algorithm-exercises-java/docs/projecteuler/problem0024.md at main · sir-gon/algorithm-exercises-java · GitHub
Skip to content

Latest commit

 

History

History
17 lines (14 loc) · 543 Bytes

File metadata and controls

17 lines (14 loc) · 543 Bytes

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:

$$ \begin{matrix} 012 & 021 & 102 & 120 & 201 & 210 \end{matrix} $$

What is the millionth lexicographic permutation of the digits $ 0, 1, 2, 3, 4, 5, 6, 7, 8 $ and $ 9 $?