7.2.2 (next_permutation-STL)

Source: Internet
Author: User

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 ;}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.