Search - josephus

Search - josephus - List

[Algorithm] Josephus DL : 0: Josephus 问题描述数据结构为链表的插入与查询-Josephus Problem Description
Date : 2026-01-09 Size : 4kb User : 程本飞
[Algorithm] josephus DL : 0: josephus问题，该问题非常经典，有助于初学者学习-josephus problem, the problem is very classic, will help beginners learn
Date : 2026-01-09 Size : 6kb User : 田威
[Algorithm] Josephus DL : 0: Josephus Problem implementation.
Date : 2026-01-09 Size : 1kb User : gowdd
[Algorithm] Josephus_problem DL : 0: 自己编写的Josephus问题的求解方法，用C语言采用数组方式实现，个人认为比教科书上提供的方法要精简的多，和大家一起分享-I have written Josephus problem solving method, using C language using an array of ways to achieve, personally think that way than the provision of textbooks to be streamlined and more to share with everyone
Date : 2026-01-09 Size : 867kb User : weiw
[Algorithm] Josephus DL : 0: 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。 -Known n individuals (in numbers 1,2,3 ... n respectively) sitting around a round table around. From the number of people began to report the number of k, the number to the person out of the column m his newspaper the next person and from a starting number, count m, then a man out and so Law be repeated until the round table around were all out of the column.
Date : 2026-01-09 Size : 1kb User : liuchenglong
[Algorithm] Josephus DL : 0: Josephus permutation algorithm
Date : 2026-01-09 Size : 709kb User : Sergiu
[Algorithm] sd2 DL : 0: 约瑟夫环问题的程序清单-Josephus list of procedures-Josephus problem program list-Josephus list of procedures
Date : 2026-01-09 Size : 1kb User : fghfghrtr
[Algorithm] josephus DL : 0: 约瑟夫环问题，还包括很多很多其他的小程序-Josephus also includes a lot of other small programs
Date : 2026-01-09 Size : 3.14mb User : 陶程序员
[Algorithm] Josephus--Problem DL : 0: 问题描述：n个人围成一个环，从第i个开始，由1到interval不断报数，凡报到interval的出列，直到环空为。出列的人按先后顺序构成一个新的序列。例如，n=8，i=2，interval=3.则输出序列为：4 7 2 6 3 1 5 8-Problem description: n individuals into a ring, from the beginning, I by 1 to interval number off, report any interval matri, till the annulus. Break the ranks of people according to the order in which they constitute a new sequence. For example, n = 8, I = 2, interval = 3. The output sequence is: 4 7 2 6 3 1 5 8
Date : 2026-01-09 Size : 17kb User : zhongdecai
[Algorithm] Josephus-(4) DL : 0: Josephus alghoritm in C -Josephus alghoritm in C
Date : 2026-01-09 Size : 151kb User : Barbos
[Algorithm] yuesefuhuan DL : 0: 解决有关约瑟夫环的数学计算问题,约瑟夫环的相关定义可上网查询-solve the problem about Josephus by airthmetic
Date : 2026-01-09 Size : 1kb User : fengpan