Permutations

Write a program that, given n different words s₁, …, s_(n), prints all
the permutations that can be made up with the words.

Input

Input consists of a number n > 0, followed by s₁, …, s_(n).

Output

Print all the permutations that can be made up with s₁, …, s_(n).

Information about the checker

You can print the solutions to this exercise in any order.

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-26T07:50:13.503Z

© Jutge.org, 2006–2026.
https://jutge.org
