poj 1256 next_permutation
2013-04-08 18:48
375 查看
Anagram
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
Sample Output
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'.
Source
Southwestern European Regional Contest 1995
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 16165 | Accepted: 6589 |
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'.
Source
Southwestern European Regional Contest 1995
本题重点在cmp函数的定义上~
#include<iostream> #include<algorithm> #include<stdlib.h> using namespace std; bool cmp(const char &a, const char &b) { if(a<='Z' && a>='A' && b<='Z' && b>='A') return a<b; if(a<='z' && a>='a' && b<='z' && b>='a') return a<b; if(a<='Z' && a>='A' && b<='z' && b>='a') return a+'a'-'A'<=b; if(a<='z' && a>='a' && b<='Z' && b>='A') return a<b+'a'-'A'; } int main(){ // freopen("C:/Users/Administrator/Desktop/contest95/Anagram/anagram.in","r",stdin); // freopen("C:/Users/Administrator/Desktop/contest95/Anagram/anagram11.txt","w",stdout); int n; char str[1000]; scanf("%d",&n); while(n--){ scanf("%s",&str); int len = strlen(str); sort(str,str+len,cmp); printf("%s\n",str); while(next_permutation(str,str+len,cmp)){ printf("%s\n",str); } } return 0; }
相关文章推荐
- next_permutation,POJ(1256)
- POJ - 1256 再次熟悉next_permutation
- POJ1256 Anagram STL中的next_permutation()
- poj 1256 按一定顺序输出全排列(next_permutation)
- poj1256 Anagram (next_permutation())
- poj 1256 Anagram—next_permutation的神奇应用
- POJ 题目1256 Anagram(next_permutation)
- POJ 1256 Anagram(next_permutation全排列)
- poj 1833 排列 next_permutation
- poj 1833 排列 库函数 next_permutation 的调用
- POj 1883 数字排列 next_permutation解决之
- poj 3187 next_permutation简单应用
- POJ 3187 Backward Digit Sums(next_permutation()+ 组合数)
- next_permutation暴力搜索,POJ(3187)
- 有关next_permutation()函数的用法, poj 2718
- POj-2718 Smallest Difference--全排列next_permutation()的应用文章标题
- POJ 3187 Backward Digit Sums next_permutation()使用
- POJ 1833 排列(字典序全排列、next_permutation()、copy+流迭代器)
- POJ 1833 排列(next_permutation)
- POJ 3187 Backward Digit Sums next_permutation()使用