2, Joseph (Josephus) loop problem: number 1,2,3, ..., n individuals sitting around a circle clockwise, each holding a password (positive integer). Choose the beginning of a positive integer as a limit on the number of reported m, starting from the first person clockwise order starting from a report number, report m, stop. Reported m the person out of the column, his password as the new value of m, in the clockwise direction from his next began to re-reported from a number, it goes on, until everyone all the columns up.

约瑟夫环\Josephus1.cpp
........\Josephus1.png
约瑟夫环

• 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．