Skip to content

Latest commit

 

History

History
15 lines (11 loc) · 958 Bytes

File metadata and controls

15 lines (11 loc) · 958 Bytes

Problem 24 : Lexicographic Permutations

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?

Expected Output

Published: Friday, 16th August 2002, 12:00 pm
Difficulty rating: 5%
Overview (PDF): problem 24
Forum problem: problem 24