文件名称:yuesefuhuan
介绍说明--下载内容均来自于网络,请自行研究使用
设有编号为1,2,…,n的n(n>0)个人围成一个圈,每个人持有一个密码m。从第一个人开始报数,报到m时停止报数,报m的人出圈,再从他的下一个人起重新报数,报到m时停止报数,报m的出圈,……,如此下去,直到所有人全部出圈为止。当任意给定n和m后,设计算法求n个人出圈的次序。-Has a number 1,2, ..., n of n (n> 0) individuals in a circle, each person holds a password m. The number of individual reports from the first start, stop newspaper report m the number of people who reported m out of laps, and then the next person from the beginning of his re-reported the number, appearance, stop reporting the number of m, at m of the circle, ... ..., and so on until all the circles all up. When any given n and m, the design algorithm for getting the order of n individuals a circle.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
约瑟夫环.cpp