资 源 简 介
joseph环。任务：编号是1，2，……，n的n个人按照顺时针方向围坐一圈，每个人只有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向的下一个人开始重新从1开始报数，如此下去，直到所有人全部出列为止-joseph ring. Tasks: number is 1,2, ... ..., n of the n individuals in accordance with the clockwise direction around a circle, each person there is only one password (positive integer). One began to choose a positive integer as the number of reported upper limit m, from the first individual to start a clockwise direction since the beginning of the order of one off, back off m stop. Reported m the person out of his password as the new m value, in a clockwise direction from his next re-started from the beginning of one off, it goes on like this until all the column until all
