/
195.cpp
51 lines (49 loc) · 969 Bytes
/
195.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
using namespace std;
bool comp(char A, char B){
char sa = tolower(A);
char sb = tolower(B);
if( sa == sb )
return A < B;
return sa < sb;
}
int main(){
//freopen("testI.txt", "r", stdin);
//freopen("testO.txt", "w", stdout);
int test;
scanf("%d", &test);
while( test-- ){
char str[10000];
scanf("%s", str);
int N = strlen(str);
sort(str, str+N, comp);
do{
printf("%s\n", str);
}while( next_permutation(str, str+N, comp) );
}
return 0;
}