Introduction - If you have any usage issues, please Google them yourself
Simulation Josephus (Josephus): n individuals (No. 1, 2, 3, ......, n (n> 0)) sitting around the circle clockwise, each holding a positive integer password. The beginning of any given two values: a first reported the number of people the number of i (0 <i<=n)锛屽彟涓