uva10098 全排列分分钟搞定

最新推荐文章于 2017-11-13 23:22:00 发布

原创最新推荐文章于 2017-11-13 23:22:00 发布 · 430 阅读

0 ·

CC 4.0 BY-SA版权

数学--组合数学专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一个高效的算法，用于按升序生成给定字符串的所有排列。输入包含多个字符串，需要为每个字符串输出所有不重复的排列组合。通过使用C++标准库中的排序和全排列生成函数实现了这一目标。

10098 - Generating Fast

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1039

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

Input

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

Output

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

Sample Input

3
ab
abc
bca

Sample Output

ab
ba

abc
acb
bac
bca
cab
cba

abc
acb
bac
bca
cab
cba

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

int main()
{
   int t;
   scanf("%d",&t);
   while(t--)
   {
       char a[13];
       scanf("%s",a);
       int len=strlen(a);
       sort(a,a+len);
       do
       {
           for(int i=0;i<len;i++)
            printf("%c",a[i]);
            printf("\n");
       }while(next_permutation(a,a+len));
        printf("\n");
   }
    return 0;
}