文件名称:Jphus
介绍说明－－下载内容来自于网络，使用问题请自行百度
对于给定的1，2，…，n 中的k 个数，Josephus 想知道是否存在一个正整数m 使得
(n,m)Josephus 排列的最后k 个数恰为事先指定的这k 个数。-given for the 1,2, ..., n and k the number, Josephus would like to know whether there is a positive integer m such that (n, m) Josephus with the final k and the number of pre-specified number k this.
(n,m)Josephus 排列的最后k 个数恰为事先指定的这k 个数。-given for the 1,2, ..., n and k the number, Josephus would like to know whether there is a positive integer m such that (n, m) Josephus with the final k and the number of pre-specified number k this.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.