Introduction - If you have any usage issues, please Google them yourself
a problem described as : No. 1, 2, ..., m m by individuals sitting around a circle clockwise direction. Each person has a password (positive integers). An optional beginning of a positive integer, as reported limits on the number of n. From the first individuals to embark on the clockwise direction since the beginning of a sequence of several reported, the report n reportedly stopped a few. N reported from the series of his password as a new value of n, From his direction on the order of one person started to re-start from a few reported so on, until all of them out of ranks.
Packet : 7941965yuesefu.doc1.rar filelist
yuesefu.doc1.doc