文件名称:Josephus
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1009byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
设有n个人围坐在一个圆桌周围,现从第s个人开始报数,数到第m的人出列,然后从出列的下一个人重新开始报数,数到第m的人又出列,…,如此反复直到所有的人全部出列为止。Josephus问题是:对于任意给定的n,s和m,求出按出列次序得到的n个人员的序列。-With n individuals sitting around a round table is starting from the first s individuals reported number, the number of people out to the first m columns, and then from the next person out of the column began to count off again, several to the first m out of those people who have column, ..., and so forth until all of the columns were all out of date. Josephus The question is: For any given n, s and m, find out the columns according to the order received sequence of n-persons.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Josephus.c
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.