Joseph problem is a well-known problem: N personal circle, began to count off from the first, the M-th will be killed, the last remaining one, the rest will be killed. E.g. N = 6, M = 5, the number of the person to be killed 5,4,6,2,3. Finally, the rest of the 1st. Assuming K in circles for a good man, after K for the bad guys, your task is to determine the least M, so that all the bad guys get killed before the first good man.

Joseph
......\Debug
......\.....\Joseph.exe
......\.....\Joseph.ilk
......\.....\Joseph.obj
......\.....\Joseph.pch
......\.....\Joseph.pdb
......\.....\Joseph.res
......\.....\JosephDlg.obj
......\.....\StdAfx.obj
......\.....\vc60.idb
......\.....\vc60.pdb
......\Joseph.aps
......\Joseph.clw
......\Joseph.cpp
......\Joseph.dsp
......\Joseph.dsw
......\Joseph.h
......\Joseph.ncb
......\Joseph.opt
......\Joseph.plg
......\Joseph.rc
......\JosephDlg.cpp
......\JosephDlg.h
......\ReadMe.txt
......\Resource.h
......\StdAfx.cpp
......\StdAfx.h
......\res
......\...\Joseph.ico
......\...\Joseph.rc2

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