该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Problem Description

Output, in lexicographic order, all non-repeating permutations of the natural numbers $1$ to $n$, i.e., the full set of permutations of $1$ to $n$. No generated sequence may contain repeated numbers.

Input Format

A single integer $n$.

Output Format

All non-repeating sequences composed of $1 \sim n$, one sequence per line. Each number should be printed in a field of width $5$.

3

    1    2    3
    1    3    2
    2    1    3
    2    3    1
    3    1    2
    3    2    1

Hint

$1 \leq n \leq 9$。

Translated by ChatGPT 5