Description: Joseph problems bidirectional (clockwise then counterclockwise) n individual arranged in a circle, starting the first person, press the clockwise direction, the number of m, the number of people who quit circle to m, then the next person the original direction beginning with the opposite direction of the original order continues to count m, depending on the number of times, until only the last one so far. For example, there are five individuals, number 3, then turn out artificial 3,1,4,5,2, and finally people are on the 2nd. It is known that n and m, ask the last person number?
To Search:
File list (Check if you may need any files):
双向约瑟夫.cpp
Download