Joseph used to solve the problem. Stack method. Josephus problem is a well-known problem: N individual circle, starting from the first report number, the first M months will be killed, what is left one, the others will be killed. For example, N = 6, M = 5, number of people being killed as 5,4,6,2,3. The last remaining No. 1.

Jorseve\Debug\Jorseve.exe
.......\.....\Jorseve.ilk
.......\.....\Jorseve.obj
.......\.....\Jorseve.pch
.......\.....\Jorseve.pdb
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\Jorseve.cpp
.......\Jorseve.dsp
.......\Jorseve.dsw
.......\Jorseve.ncb
.......\Jorseve.opt
.......\Jorseve.plg
.......\Debug
Jorseve

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