Description: Josephus (Josephus) a description of the problem is: Numbers for 1, 2,..., n n individual clockwise around a circle, each holding a password (positive integer).At first choose a positive integer as the upper limit count off m, since the first man since 1 count off, clockwise when reporting for m stop count off.To dequeue m, his password as the new m values, in a clockwise direction him the next person started to count off 1, so go on, until all the people all dequeue.Try to design a program to print out according to the order number.
To Search:
File list (Check if you may need any files):
顺序表约瑟夫斯.c
Download