Description: Josephus (Joseph) a description of the problem is: No. 1, 2, 3 ..., the n individuals sitting around the circle clockwise, no one holds a password (positive integer). One began to Choose a positive integer as the reported number of the upper limit of m, starting from the first person since the number of a start sequence reported in accordance with the clockwise direction, the report m stop the reported number. Reported m the person out of the line, his password as the new values of m, starting from the next person in the clockwise direction from a number off again, and so on, until all all columns so far. Try to design a program to calculate the column order.
To Search:
File list (Check if you may need any files):
循环链表\Debug\lab1.exe
........\.....\lab1.pdb
........\.....\lab2.obj
........\.....\vc60.pdb
........\lab1.dsp
........\lab1.dsw
........\lab1.ncb
........\lab1.opt
........\lab1.plg
........\lab2.cpp
........\Debug
循环链表
Download