Description: 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.
To Search:
File list (Check if you may need any files):
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
Download