Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using namespace std;
- #include <algorithm>
- #include <iostream>
- #include <iterator>
- #include <numeric>
- #include <sstream>
- #include <fstream>
- #include <cassert>
- #include <climits>
- #include <cstdlib>
- #include <cstring>
- #include <string>
- #include <cstdio>
- #include <vector>
- #include <cmath>
- #include <queue>
- #include <deque>
- #include <stack>
- #include <list>
- #include <map>
- #include <set>
- #define foreach(x, v) for (typeof (v).begin() x=(v).begin(); x !=(v).end(); ++x)
- #define For(i, a, b) for (int i=(a); i<(b); ++i)
- #define D(x) cout << #x " is " << x << endl
- int main(){
- int cases;
- cin >> cases;
- while(cases--){
- string word;
- cin >> word;
- sort(word.begin(), word.end());
- cout << word << endl;
- while(next_permutation(word.begin(), word.end())){
- cout << word << endl;
- }
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment