Search - josephus

Search - josephus - List

[Data structs] jiang qing wei DL : 0: 数据结构的源程序约瑟夫环和最短路径-data structure of the source Josephus and the shortest path
Date : 2026-01-09 Size : 51kb User : 鸡哥
[Data structs] 用C语言写的约瑟夫环 DL : 0: 数据结构课程设计，用C语言编写的约瑟夫环-data structure course design, preparation of the C language Josephus
Date : 2026-01-09 Size : 36kb User : 李火土
[Data structs] 约瑟夫环的循环链表实现 DL : 0: 约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。-Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.
Date : 2026-01-09 Size : 5kb User : 山子
[Data structs] 经典约瑟夫环问题c语言版 DL : 0: 数据结构中解决约瑟夫环问题的代码，里面只有源代码，大家用TC2编译一下就可以用了：）。-data structure to solve the problem of Josephus code, only the source code, we use TC2 compiler can use it with a :).
Date : 2026-01-09 Size : 1kb User :
[Data structs] JOSEPHUS DL : 0: 约色夫问题,数据结构实习,用链表实现,哈哈,请多指教,我是才鸟-husband about color, data structure internship with Chain realized Haha, please enlighten, I only birds
Date : 2026-01-09 Size : 1kb User : 雷天保
[Data structs] JosephusProblem DL : 0: 據說著名猶太歷史學家 Josephus有過以下的故事：在羅馬人佔領喬塔帕特後，39 個猶太人與Josephus及他的朋友躲到一個洞中，39個猶太人決定寧願死也不要被敵人到，於是決定了一個自殺方式，41個人排成一個圓圈，由第1個人開始報數，每報數到第3人該人就必須自殺，然後再由下一個重新報數，直到所有人都自殺身亡為止。然而Josephus 和他的朋友並不想遵從，Josephus要他的朋友先假裝遵從，他將朋友與自己安排在第16個與第31個位置，於是逃過了這場死亡遊戲。-It is said that the famous Jewish historian Josephus has the following story: In the Roman occupation of乔塔帕特after 39 Jews and Josephus and his friends hid in a cave, 39 Jewish spiritual sense of the word should not be decided by the enemy that decided a means of suicide, 41 individuals formed a circle, from one individual to start off, each reported a few to the first 3 people to be the person to commit suicide, and then re-reported by the next number until all committed suicide so far. However, Josephus and his friends do not want to comply, Josephus to his friends to pretend to follow, he will be friends with their own arrangements in section 16 with the first 31 positions, so escaped the death game.
Date : 2026-01-09 Size : 4kb User : 王凌云
[Data structs] Josephus DL : 0: 数据结构 c语言版约瑟夫问题顺序表方法实现-Data structure c language version of the issue of the order of Joseph Table method
Date : 2026-01-09 Size : 206kb User : differ
[Data structs] Josephus DL : 0: 面向对象的作业，面向对象的数据结构-约瑟夫环-Object-oriented operation, object-oriented data structure- Joseph Central
Date : 2026-01-09 Size : 8kb User : lyy
[Data structs] yuesefuhan DL : 0: 这是一个已经通过调试的解决约瑟夫问题的（Josephus）程序，-This is a debugging solution has passed the issue of Joseph (Josephus) procedures,
Date : 2026-01-09 Size : 3kb User : 景秀
[Data structs] Josephus DL : 0: 有编号从1到N的N个人坐成一圈报数，报到M的人出局，下一位再从1开始，如此持续，直止剩下一位为止，报告此人的编号X。输入N,M，求出X。-Numbered from 1 to N of the N individuals into a lap to sit reported the number of people who report M out, the next one to start from, and so continued until the remaining one date, the report of the person s ID X. Input N, M, to derive X.
Date : 2026-01-09 Size : 367kb User : 陆海表
[Data structs] Josephus DL : 0: 用循环链表实现的约瑟夫问题。uuhorse-By cyclic Joseph realized the problem list. uuhorse
Date : 2026-01-09 Size : 2kb User : Whitehorse32
[Data structs] JOSE2 DL : 0: Josephus 问题的解答。n个孩子围成圆圈，选任一个数m，从第一个孩子开始数，数到m停止，这个孩子离开，再从第一个开始数，直到剩下一个孩子。-Josephus questions. n children surrounded the circle, selected a number of m, from the beginning of their first child a few, a few m to stop the child to leave, and then started from the first few, until the rest of a child.
Date : 2026-01-09 Size : 1kb User : renqiang
[Data structs] JOSE3 DL : 0: Josephus 问题的解答。n个孩子围成圆圈，选任一个数m，从第一个孩子开始数，数到m停止，这个孩子离开，再从第一个开始数，直到剩下一个孩子。-Josephus questions. n children surrounded the circle, selected a number of m, from the beginning of their first child a few, a few m to stop the child to leave, and then started from the first few, until the rest of a child.
Date : 2026-01-09 Size : 1kb User : renqiang
[Data structs] Josephus DL : 0: 约瑟夫环已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。（有详细注解）数据结构学习的好例子-Joseph ring known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out. (Detailed notes) data structure to learn a good example of
Date : 2026-01-09 Size : 1kb User : mailan7749
[Data structs] JOSEPHUS DL : 0: 著名的约瑟夫环问题，采用链表数据结构　已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。　　例如：n = 9, k = 1, m = 5 　　【解答】　　出局人的顺序为5, 1, 7, 4, 3, 6, 9, 2, 8。-well-known Josephus Problem,using link list method
Date : 2026-01-09 Size : 91kb User : 宋歌
[Data structs] josephus DL : 1: 问题描述：新Josephus排列问题定义如下：假设n个人排成一个环形，给定一个正整数m，从第1 个人开始，沿环计数，每遇到第m个人就让其出列，这时计算器m自动加一，且计数继续进行下去。这个过程一直进行到所有的人都出列为止，最后出列者为赢家。设这n个人的编号分别为1～n，每次从编号为1的竞赛者开始计数，那么每个人出列的次序定义为整数1～n 的一个排列。这个排列称为一个(n,m)Josephus排列。例如，(7,3)Josephus 排列为3，7，6，2，4，1，5。对于给定的1，2，…，n中的k个数，Josephus想知道是否存在一个正整数m使得 (n,m)Josephus排列的前k个数恰为事先指定的这k个数。编程任务： (1)用抽象数据类型表设计一个求(n,m)Josephus排列的算法。 (2)试设计一个算法，对于给定的正整数n和1，2，…，n中的k个数。求正整数m，使 (n,m)Josephus排列的前k个数恰为事先指定的这k个数(顺序必须完全一样)。 -Problem Description: Josephus ordered a new problem definition is as follows: Suppose n individuals arranged in a ring, given a positive integer m, from the first one Begins with individuals along the ring count, when confronted with the first m individuals let their out of line, then automatically add a calculator m, and the count continued into the OK go on. This process continues until all of them out of the column until the last person out of the column as a winner. This set up the individual numbers n Respectively, 1 ~ n, each number is one from the race have begun to count, then the order of each person out of the column is defined as an integer 1 ~ n An array. This arrangement is called a (n, m) Josephus arranged. For example, (7,3) Josephus arranged as 3,7,6,2,4,1,5. For a given 1,2, ..., n in the k-number, Josephus would like to know whether there is a positive integer m makes the (n, m) Josephus arranged in exactly the number of pre-k this for a pre-specified k number
Date : 2026-01-09 Size : 2kb User : atlantis
[Data structs] Josephus--problem DL : 0: 约瑟夫斯（Josephus）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向下一个人开始重新从1报数，如此下去，直至所有的人全部出列为止。试设计一个程序，按出列顺序印出各人编号。-Josephus (Josephus) a description of the problem are: number 1,2, ..., n of n individuals sitting around a circle clockwise, each holding a password (positive integer). Choose a positive integer beginning as a limit on the number of reported m, starting from the first person to start a clockwise direction from a report number, report the number of reported m stop. Who reported m out of line, his password as the new m value, in a clockwise direction from the next person he began to re-reported from a number, it goes on until all the people all of the columns so far. Design a program, according to the column order prints each number.
Date : 2026-01-09 Size : 56kb User : 冯柳鑫
[Data structs] Josephus问题：一个热土豆引发的故事 DL : 1: 数据结构编程实验：Josephus问题：一个热土豆引发的故事(Data Structure Experiment: Josephus question: the story of a hot potato)
Date : 2026-01-09 Size : 1kb User : enemy
[Data structs] josephus problem DL : 0: 分别通过顺序表和链表的方式，利用C++实现约瑟夫斯问题(C++ implementation of the Josephus problem)
Date : 2026-01-09 Size : 1.46mb User : 嘉树
[Data structs] josephus DL : 0: 通过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)
Date : 2026-01-09 Size : 4kb User : 靇笙

« 12 3 4 5 6 7 8 9 10 »