题意:都是生成排列的,用 next_permutation(),排序前,先保证他是最小序列
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char a[15];
int main()
{
int t;
scanf("%d",&t);
getchar();
while (t--)
{
gets(a);
int len = strlen(a);
sort(a,a+len);
do
{
for(int i = 0 ; i < len ; i++)
cout<<a[i];
cout<<endl;
}
while (next_permutation(a,a+len));
printf("\n");
}
return 0;
}