Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Автор: Фёдор Меньшиков, ВГПУ.
Difficulty Alpha
Permutations
Translated by Google
Russian
A string consisting of M symbols. Display all permutations
of this string of characters.
Input
The first line of the file is the original string.
Output
Output in each line of the file for one
permutation. Permutations can be output in any order.
Repetition and rows that are not permutations of the original,
should not be.
Limitations
2 ≤ M ≤ 8; characters - the letters of the
alphabet and numbers.
|
Sample 1
|
Sample 2
|
AB
|
IOX
|
|
Sample Output 1
|
Sample Output 2
|
AB
BA
|
XOI
OIX
IXO
XIO
OXI
IOX
|
Для отправки решений необходимо выполнить вход.
|