Generate permutations
Given a string with unique characters
s, you are asked to print all the possible |s|! permutations of the string.Input
The input contains a single line representing
s (1 ≤ |s| ≤ 8). It’s guaranteed that all the letters are unique.Output
The program should print all the possible permutations of
s each on a separate line. They can be in arbitrary order.Examples
Input | Output |
abc | abc
acb
bac
bca
cab
cba |
Constraints
Time limit: 0.6 seconds
Memory limit: 512 MB
Output limit: 15 MB