7.2.2 (next_permutation-STL)

Library functions are much more convenient to use,

But I don't have msdn, so I am reading the source code ..

No matter... this is obviously fast. It should be simple.

Paste the code:

# Include <stdio. h> # include <string. h >#include <iostream >#include <algorithm> # include <string> using namespace STD; char STR [1111]; int main () {While (scanf ("% s", STR )! = EOF) {cout <Endl; int n = strlen (STR); sort (STR, STR + n); // The full sorting method is to sort first ,, dizzy. puts (STR); While (next_permutation (STR, STR + n) // It is convenient, hey... {puts (STR) ;}} system ("pause"); Return 0 ;}