Description: The n (n > 0) individuals are surrounded by a circle, numbered 1 to N, and all hold the same password m. From the first person from 1 to start off, back off m stop, the person out of the ring. The next person to start off from the 1 stop, back off m, the man out of the ring. And so on, until all people get out of the circle. Arbitrarily given n and m, determine whether the input is legitimate, if the reason is unlawfully specified; if the legitimate output of the corresponding out of the ring sequence.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| yuesefuhuan.cpp | 2165 | 2017-06-18
|
| 报告.pdf | 346447 | 2018-03-13 |
Download