Generating n digital ortho exchange method utilizing all n! Permutations. Given a positive integer n, then n numbers 1 to n which may constitute n! Permutations. Ortho arrangement swap method is that all n! Order of the units of one kind, are arranged such that each two adjacent positions are interchanged only two adjacent numbers occurred.

题目说明.txt
邻位互换.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．