Josephus problem: Let numbered 1, 2, 3, ...... n n (n> 0) individuals sitting around a circle in a clockwise direction, each person holds a positive integer password. Optional when the start of a positive integer as reported the maximum number of m clockwise direction from the first person, self-a starting sequence reported number, report m stop the reported number of reported m the column, as a new password the value of m, start again from 1 number off from his next personal. It goes on, until all the columns until all. Let n be the maximum take 30. Asked to design a program to simulate the process, find the column number sequence

2\1.cpp
.\1.dsp
.\1.dsw
.\1.ncb
.\1.opt
.\1.plg
2

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