首页 / 软件开发 / 数据结构与算法 / UVa 10098 Generating Fast：全排列生成

UVa 10098 Generating Fast：全排列生成2014-07-10 synapse7 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

STL算法搞定。

完整代码：

01./*0.042s*/02.03.#include<cstdio>04.#include<cstring>05.#include<algorithm>06.using namespace std;07.08.char str[15];09.10.int main（void）11.{12.int t, len;13.scanf（"%d
", &t）;14.while （t--）15.{16.gets（str）;17.len = strlen（str）;18.sort（str, str + len）;19.do20.puts（str）;21.while （next_permutation（str, str + len））;///此方法不会重复输出22.putchar（"
"）;23.}24.return 0;25.}