Joseph algorithm: n individuals in a circle, each with a different number, choose a person as a starting point, and then clockwise to count from 1 to k, each count to exit the circle k, narrow circle, and then from the next person to continue to count from 1 to k, repeat the above process. And the man finally launched circle of the original number. Idea: according to the above algorithm to exit the circle, until there is n- 1 personal circle, and then get the final out of the number people. The serial number of procedures: sit in a circle of people do not need to be arranged in sequence

约瑟夫环问题求解算法.C

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