MAIN Home Schedule Rules Compile PROBLEMS Novice Veteran All |
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.
You are to write a program that has to generate all possible unique words from a given set of letters. Example: Given the word "abc", your program should - by exploring all different combination of the three letters - output the words "abc", "acb", "bac", "bca", "cab" and "cba". In the word taken from input, 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. No input word will be longer than 8 letters.
InputThe input consists of several words. The first line contains a number giving the number of words to follow. Each following line contains one word. A word consists of lowercase letters from a to z.
OutputFor each word in the input, the output should contain all different 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
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set. Test Data 0
2 abc acba
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set. Output for Test Data 0
abc acb bac bca cab cba aabc aacb abac abca acab acba baac baca bcaa caab caba cbaa
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set. Test Data 1
3 a ab abcd
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set. Output for Test Data 1
a ab ba abcd abdc acbd acdb adbc adcb bacd badc bcad bcda bdac bdca cabd cadb cbad cbda cdab cdba dabc dacb dbac dbca dcab dcba
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set. Test Data 2
3 ab abde
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set. Output for Test Data 2
ab ba abde abed adbe adeb aebd aedb bade baed bdae bdea bead beda dabe daeb dbae dbea deab deba eabd eadb ebad ebda edab edba abde abed adbe adeb aebd aedb bade baed bdae bdea bead beda dabe daeb dbae dbea deab deba eabd eadb ebad ebda edab edba
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set. Test Data 3
3 abc d fg
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set. Output for Test Data 3
abc acb bac bca cab cba d fg gf
Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.
|
This page last updated Fri Feb 11 21:55:29 2000.