<reponame>klen/euler
""" Project Euler problem #24. """

import itertools as it


def problem():
    """ Solve the problem.

    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?

    Answer: 2783915460

    """
    digits = '0123456789'

    return ''.join(next(it.islice(it.permutations(digits), 999999, 1000000)))


if __name__ == '__main__':
    print problem()

""" Project Euler problem #24. """

import itertools as it


def problem():
    """ Solve the problem.

    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?

    Answer: 2783915460

    """
    digits = '0123456789'

    return ''.join(next(it.islice(it.permutations(digits), 999999, 1000000)))


if __name__ == '__main__':
    print problem()
Project Euler problem #24. Solve the problem.      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?      Answer: 2783915460