poj-1256-Anagram
来源:互联网 发布:网络写手排名 编辑:程序博客网 时间:2024/06/05 08:14
Description
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 different combination of the three letters - output the words “abc”, “acb”, “bac”, “bca”, “cab” and “cba”.
In the word taken from the input file, 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 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 uppercase or lowercase letters from A to Z. Uppercase and lowercase letters are to be considered different. The length of each word is less than 13.
Output
For 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. An upper case letter goes before the corresponding lower case letter.
Sample Input
3
aAb
abc
acba
Sample Output
Aab
Aba
aAb
abA
bAa
baA
abc
acb
bac
bca
cab
cba
aabc
aacb
abac
abca
acab
acba
baac
baca
bcaa
caab
caba
cbaa
Hint
An upper case letter goes before the corresponding lower case letter.
So the right order of letters is ‘A’<’a’<’B’<’b’<…<’Z’<’z’.
题意:全排列
题解:stl
DescriptionYou 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 different combination of the three letters - output the words "abc", "acb", "bac", "bca", "cab" and "cba".In the word taken from the input file, 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.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 uppercase or lowercase letters from A to Z. Uppercase and lowercase letters are to be considered different. The length of each word is less than 13.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. An upper case letter goes before the corresponding lower case letter.Sample Input3aAbabcacbaSample OutputAabAbaaAbabAbAabaAabcacbbacbcacabcbaaabcaacbabacabcaacabacbabaacbacabcaacaabcabacbaaHintAn upper case letter goes before the corresponding lower case letter.So the right order of letters is 'A'<'a'<'B'<'b'<...<'Z'<'z'.
- POJ 1256 Anagram
- POJ 1256 Anagram
- poj 1256 Anagram
- poj 1256 Anagram
- POJ 1256 Anagram
- poj 1256 Anagram
- poj 1256 Anagram
- poj 1256 Anagram
- Anagram poj 1256
- poj 1256(Anagram)
- POJ - 1256 Anagram
- 7 POJ 1256 Anagram
- poj 1256 Anagram
- POJ 1256:Anagram
- POJ 1256 Anagram
- POJ - 1256 Anagram
- poj 1256 Anagram
- poj-1256-Anagram
- gulp教程之gulp-htmlmin
- javascript的getElementsByTagName() 方法
- javascript事件绑定的三种方法
- 2016/09/22 一大波华为机考题目来袭
- MySQL 数据类型BINARY和VARBINARY
- poj-1256-Anagram
- 使用Spark调用word2vec接口将文本转化为向量
- Effective stl 第23条:考虑用排序的vector代替关联容器
- war文件如何打开
- HDU-5536 Chip Factory(字典树)
- js 算出Array数组中出现次数最多的元素
- [kuangbin带你飞]专题七 线段树 J HDU 3974
- JAVA基础知识点梳理五:方法
- 第四周【项目三-单链表应用(3)单链表的递增】