UVaOJ10098---Generating Fast

10098 - Generating Fast

Time limit: 3.000 seconds

 

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

---

Shahriar Manzoor

方法一：使用STL next_permutation()

#include 
#include 
#include 
using namespace std;

int main()
{
    int n;
    char p[11];
    cin>>n;
    while (n --) {
        cin>>p;
        sort(p, p + strlen(p));
        do {
            for (int i = 0; i < (int)strlen(p); i ++) {
                cout<

方法二：直接枚举

#include 
#include 
#include 
using namespace std;

void print_permutation(int n, char P[], char A[], int cur)  {
    int i, j;
    if (cur == n) {
        for (int i = 0; i < n; i ++) {
            cout<>n;
    while (n --) {
        cin>>P;
        cur = 0;
        sort(P, P + strlen(P));
        print_permutation(strlen(P), P,  A, cur);
        cout<