Scribd
Upload
42 views1 page

Anagram

This document describes a programming problem to generate all possible anagrams from a given set of letters. The input will consist of multiple words, and for each word the program must output all unique rearrangements of the letters in alphabetical order. Sample input and output are provided to demonstrate the expected format.

Uploaded by

Reena Domino
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
42 views1 page

Anagram

This document describes a programming problem to generate all possible anagrams from a given set of letters. The input will consist of multiple words, and for each word the program must output all unique rearrangements of the letters in alphabetical order. Sample input and output are provided to demonstrate the expected format.

Uploaded by

Reena Domino
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

ACM Contest Problems Archive

University of Valladolid (SPAIN)

195 Anagram
You are to write a program that has to generate all possible words from a given set of letters.
Example: Given the word "abc", your program should - by exploring all di erent combination of the
three letters - output the words "abc", "acb", "bac", "bca", "cab" and "cba".
In the word taken from the input le, some letters may appear more than once. For a given word,
your program should not produce the same word more than once, and the words should be output in
alphabetically ascending order.

Input

The input le consists of several words. The rst line contains a number giving the number of words to
follow. Each following line contains one word. A word consists of uppercase or lowercase letters from A
to Z. Uppercase and lowercase letters are to be considered di erent.

Output

For each word in the input le, the output le should contain all di erent words that can be generated
with the letters of the given word. The words generated from the same input word should be output in
alphabetically ascending order.

Sample Input
2
abc
acba

Sample Output
abc
acb
bac
bca
cab
cba
aabc
aacb
abac
abca
acab
acba
baac
baca
bcaa
caab
caba
cbaa

You might also like