文件名称:yuesefuwenti
介绍说明--下载内容均来自于网络,请自行研究使用
有n个小孩围成一圈(编号从1~n),从编号为1的小孩开始顺序循环报数1~m,凡报m者出圈,直到圈中所剩唯一者(称为获胜者)。给定正整数n及m,计算获胜者的编号。-There are n children form a circle (number from 1 ~ n), from the number of children of 1 cycle at the beginning of the order of the number of 1 ~ m, where m is reported from the circle, until the only remaining person in the circle (known as the winner persons). Given positive integer n and m, calculate the number of winners.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
约瑟夫问题.cpp
约瑟夫问题.exe
约瑟夫问题.exe