设有编号为1,2,…,n的n（n＞0）个人围成一个圈，每个人持有一个密码m。从第一个人开始报数，报到m时停止报数，报m的人出圈，再从他的下一个人起重新报数，报到m时停止报数，报m的出圈，……，如此下去，直到所有人全部出圈为止。当任意给定n和m后，设计算法求n个人出圈的次序。建立模型，确定存储结构。对任意n个人，密码为m，实现约瑟夫环问题。-Has numbered 1,2, ..., n of n (n> 0) individuals in a circle, each person holding a password m. Stop when the first person to start off, report from the reported number m at m out of laps, and then starting again from his next report the number of individuals, stop, back off m, reported m out of the ring, ...... , and so on, until all the laps so far. When any given n and m, n individual design algorithm for a circle of order. Modeling to determine the storage structure. N for any individual, the password is m, to achieve Josephus problem.