> 

用 STL 切记 写个正确的 cmp 函数~
另外 用next_permutation 时在里面要加上 cmp 函数~


Problem: 1256  User: 810974380 
Memory: 188K  Time: 47MS 
Language: C++  Result: Accepted 

Source Code 
#include<iostream>
#include<string.h>
#include<ctype.h>
#include<algorithm>
using namespace std;
char st[15];unsigned int len;
int t;
bool cmp(char a, char b) {
    return tolower(a) == tolower(b) ? a < b : tolower(a) < tolower(b);
}
int main()
{
  scanf("%d",&t);
  getchar();
  while(t--)
  {
	 gets(st);
     len=strlen(st);
     sort(st,st+len,cmp);
     while(1)
     {
	    puts(st);
	    if(!next_permutation(st,st+len,cmp)) break;
     }
  }
  system("pause");
  return 0;
}