Description: Josephus problem is a well-known problem: N personal circle, starting from the first report the number of M will be killed first, the last remaining one, the rest will be killed. For example, N = 6, M = 5, the number of people killed 5,4,6,2,3. The last remaining No. 1. Assumed that the first K in circles as a good man, after the K was bad person, your task is to determine this minimum M, makes all the bad guys in a good man to be killed before
To Search:
File list (Check if you may need any files):
yuesefu.cpp
Download