POJ-1256 next_permutation函数应用

#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
bool cmp( char a, char b)
{
    if(a <= 'Z' && a >= 'A' && b <= 'Z' && b >= 'A')
        return a < b;
    if(a <= 'z' && a >= 'a' && b <= 'z' && b >= 'a')
        return a < b;
    if(a <= 'Z' && a >= 'A' && b <= 'z' && b >= 'a')
        return a + 32 <= b;
    if(a<='z' && a >='a' && b <= 'Z' && b >= 'A')
        return a < (b + 32);
}
int main()
{


    int n;
    cin>>n;
    while(n--)
    {
    char aa[120];
    cin>>aa;
    int a=strlen(aa);
    sort(aa,aa+a,cmp);
    cout<<aa<<endl;
    while(next_permutation(aa,aa+a,cmp))
    {
    cout<<aa<<endl;

    }


    }
return 0;
}