UVAOJ 10098 Generating Fast

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <string>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cassert>
using namespace std;
char  s[15];
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
scanf("%s",s);
int len=strlen(s);
sort(s,s+len);
do
{
printf("%s\n",s);

}while(next_permutation(s,s+len));
printf("\n");
}

return 0;
}