#include <iostream>
#include <algorithm>
using namespace std;

#define MAXN 13

char a[MAXN + 1];
int len;
char flag[MAXN];
char s[MAXN + 1];

bool cmp(char a, char b) {
    return tolower(a) == tolower(b) ? a < b : tolower(a) < tolower(b);
}

void solve(int n) {
    if (n == len) {
        puts(s);
        return;
    }
    for (int i = 0; i < len; i++) {
        if (! flag[i]) {
            flag[i] = 1;
            s[n] = a[i];
            solve(n + 1);
            flag[i] = 0;
            while (i + 1 < len && a[i + 1] == a[i]) i++;
        }
    }
}

int main() {
    int CASE;
    scanf("%d", &CASE);
    while (CASE--) {
        scanf("%s", a);
        len = strlen(a);
        sort(a, a + len, cmp);
        memset(flag, 0, sizeof(flag));
        s[len] = 0;
        solve(0);
    }
    return 0;
}

• Re:递归，代码，此题坚决不用STL，那样太没意思 (18) lijinwu 2009-12-11 20:48:50
  • Re:递归，代码，此题坚决不用STL，那样太没意思 (26) watertonylzc 2010-07-03 16:08:38
• why --------- ! [ s[len] = 0; ] -------- WA, --or---AC??????????????????????????? (944) 20091101579 2011-04-11 14:09:49
• Re:递归，代码，此题坚决不用STL，那样太没意思 (984) 50573750 2011-05-26 21:17:33
• Re:递归，代码，此题坚决不用STL，那样太没意思 (944) liuyinhou 2020-05-20 23:12:33
  • Re:递归，代码，此题坚决不用STL，那样太没意思 (0) 184300148 2020-06-06 16:42:12