文件名称:josph
介绍说明--下载内容均来自于网络,请自行研究使用
编号是1,2,……,n的n个人按照顺时针方向围坐一圈,每个人持有一个密码(正整数)。一开始任选一个正整数作为报数上限值m,从第一个人开始顺时针方向自1开始顺序报数,报到m时停止报数。报m的人出列,将他的密码作为新的m值,从他在顺时针方向的下一个人开始重新从1报数,如此下去,直到所有人全部出列为止。-Number is 1,2, ... ..., n of the n individuals in accordance with the clockwise direction around a circle, each person holding a password (positive integer). Beginning optional reported a positive integer as the number of upper limit of m, from the first individual to start a clockwise direction since the beginning of the order of 1 reported the number of reported back m the number of stops. Reported m the person out of his password as the new m value, in a clockwise direction from his next re-started from 1 off, so until all the column until all.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
josph.cpp