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