UVA10098 Generating Fast【全排列】

Generating permutation has always been an important problem in computer science. In this problemyou will have to generate the permutation of a given string in ascending order. Remember that youralgorithm must be efficient.

Input

The first line of the input contains an integer n, which indicates how many strings to follow. The nextn lines contain n strings. Strings will only contain alpha numerals and never contain any space. Themaximum length of the string is 10.

Output

For each input string print all the permutations possible in ascending order. Not that the strings shouldbe treated, as case sensitive strings and no permutation should be repeated. A blank line should followeach output set.

Sample Input

3

ab

abc

bca

Sample Output

ab

ba

abc

acb

bac

bca

cab

cba

abc

acb

bac

bca

cab

cba

问题链接：UVA10098 Generating Fast。

题意简述：参见上文。

问题分析： 这个问题是按字典序从小到大输出字符串的全排列。

程序说明：（略）

题记：（略）

AC的C++语言程序如下：

/* UVA10098 Generating Fast */

#include 
#include 
#include 
#include 

using namespace std;

const int N = 10;
char s[N+1];

int main()
{
    int t, len;

    scanf("%d", &t);
    while(t--) {
        scanf("%s", s);

        len = strlen(s);
        sort(s, s + len);

        do {
            printf( "%s\n", s);
        } while(next_permutation(s, s + len));
        printf( "\n");
    }

    return 0;
}