P382: Enumeration of all arrangements with $n$ marks

P382: Enumeration of all arrangements with $n$ marks

Input:

An integer $n$.

Output:

All arrangements with $n$ marks.

Complexity:

$O(n!)$ total time.

Comment:

Reference:

[Johnson1963] (Bibtex)