标签:
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 | #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 cmp( char ch1, char ch2){ if ( tolower (ch1) < tolower (ch2)) return 1; else if ( tolower (ch1) == tolower (ch2) && ch1 < ch2 ) return 1; return 0; } int main() { char str[20]; int t; cin>>t; while (t--){ cin>>str; vector<string> vec; int len = strlen (str); sort(str,str + len,cmp); do { cout<<str<<endl; } while ( next_permutation( str,str + len,cmp)); } return 0; } |
标签:
原文地址:http://www.cnblogs.com/qhy285571052/p/5143012.html