Joseph Ring is a typical problem with circular list data structure is a list of the last element pointer to force the first element. The core problem-solving steps: 1. To establish a link with n-points, without a head of circular list node 2. Identified the first one reported the location of several people 3. Continuously removed from the list link point, until the list is empty. Specific process is to first build a one-way circular linked list, these people used to store code and password. Then delete the number m of people reported in these individuals at the same time remove the password and label output. Delete this list until it is empty. This is what I solve this problem.

约瑟夫环.txt

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