Order tables, one-way circular linked list storage
no vote
Joseph link, (Joseph) is a description of the problem: n numbered 1, 2, 3......n individuals in a clockwise direction around a circle, no one holds a password (a positive integer). A pick a positive integer as a number of top m, in a clockwise direction from the first person numbered sequentially starting from 1, numbered stops when reporting for m. M people out, put his password as the new value of m, clockwise direction from his next start back from numbered 1, and so on, until all the listed as (2) the order tables, one-way circular linked list storage structure simulation of this process