Josephus problem: Let numbered 1,2,3, ... ..., n of the n (n> 0) individuals sitting around a circle clockwise, each person has a positive integer password. Choose the beginning of a positive integer as the reported maximum number of m, starting clockwise from the first person from the sequence reported from a number of m is to stop the newspaper to report the number of people reported m the column, his password as a new m value, the next person from the beginning of his re-reported from a number. It goes on, until all the columns up for all. Let n be the maximum take 30. To design a program to simulate this process, find out the column number sequence.

约瑟夫2\main.cpp
.......\约瑟夫2.dsp
.......\约瑟夫2.dsw
.......\约瑟夫2.ncb
.......\约瑟夫2.plg
.......\Debug\main.obj
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\.....\约瑟夫2.exe
.......\.....\约瑟夫2.ilk
.......\.....\约瑟夫2.pch
.......\.....\约瑟夫2.pdb
.......\约瑟夫2.opt
.......\Debug
约瑟夫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．