登录
首页 » Visual C++ » josephus

josephus

于 2017-11-12 发布 文件大小:4KB
0 210
下载积分: 1 下载次数: 1

代码说明:

  通过c语言数组算法解决josephus问题,m个人围成一圈,从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开,最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • eitTableParse
    该程序分析eit表的数据结构,病输出相应内容信息(parse eit table and output content info)
    2016-05-22 17:52:42下载
    积分:1
  • yuesefuhuan
    使用VC编写的约瑟夫环程序,简单明了,方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)
    2009-09-08 16:45:26下载
    积分:1
  • c语言,码图合集
    说明:  a set of uestc computer academic matu
    2020-04-05 20:19:20下载
    积分:1
  • paixu
    实现冒泡,快速,希尔排序法。并计算,比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
    2012-05-21 22:13:12下载
    积分:1
  • fibonaqi
    说明:  斐波那契 式子计算,属于算法类的 用于VC6.0++(Fibonacci calculation formulas, algorithms are used to VC6.0++ class)
    2011-04-07 09:10:16下载
    积分:1
  • sort
    归并排序,复习排序算法,在不同环境下,寻找时间复杂度最少的排序算法( Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)
    2013-11-05 22:15:57下载
    积分:1
  • kaikuohaohebikuohaodepipei
    开括号和比括号的匹配,数据结构内容,很不错(More than brackets and brackets to open the match, the contents of data structure)
    2009-04-13 14:35:56下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • 8sort_method
    随机函数产生10000个随机数,用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序,并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义,系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)
    2013-02-27 17:27:04下载
    积分:1
  • migongproduce
    迷宫生成器,可以根据需要自己建立各类型的迷宫,而且能求解出线路(Maze maze of various types of generators, according to the needs its own, but also to solve the lines)
    2012-02-10 15:17:36下载
    积分:1
  • 696516资源总数
  • 106637会员总数
  • 8今日下载