1256 Anagram 全排列 next_permutation 用法

排列组合生成算法

最新推荐文章于 2020-03-06 12:26:55 发布

原创最新推荐文章于 2020-03-06 12:26:55 发布 · 523 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#permutation #output #input #each #less #string

acm_数学问题专栏收录该内容

163 篇文章

订阅专栏

本文介绍了一个用于生成由给定字符集组成的所有可能单词的算法。该算法确保输出的单词按字母顺序排列且不重复，特别适用于包含重复字符的情况。通过使用自定义比较逻辑和next_permutation函数实现了这一目标。

Anagram

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 11921		Accepted: 4877

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'.

#include<iostream>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
struct node
{
    int flag;
    char ch;
};
bool cmp(node a,node b)
{
    return a.flag<b.flag;
}
int main()
{
    int ci;
    cin>>ci;
    while(ci--)
    {
        node p[20];
        map<char ,int > q;
        for(int i='A',l=1;i<='Z';i++,l+=2) q[i]=l;
        for(int i='a',l=2;i<='z';i++,l+=2) q[i]=l;
        string str;
        cin>>str;
        for(int i=0;i<str.size();i++) p[i].ch=str[i],p[i].flag=q[str[i]];
        sort(p,p+str.size(),cmp);
        do
        {
            for(int i=0;i<str.size();i++) cout<<p[i].ch;cout<<endl;
        }while(next_permutation(p,p+str.size(),cmp));
    }
    return 0;
}