Search - josephus

Search - josephus - List

[CSharp] josephus.1 DL : 0: 描述：设编号为1,2,…,n(n>0)个人按顺时针方向围坐一圈，每人持有一个正整数密码。开始时任意给出一个报数上限值m，从第一个人开始顺时针方向自1起顺序报数，报到m时停止报数，抱m的人出列，从他在顺时针方向上的下一个人起重新自1起顺序报数；如此下去，直到所有人全部出列为止。要求设计一个程序模拟此过程，并给出出列人的编号序列。．算法思想： Jeseph函数是实现问题要求的主要函数，其算法思想是：从1至m对带头结点的单循环链表循环计数，到m时，输出该结点的编号值，，再从该结点的下一个结点起重新自1起循环计数；如此下去，直到单循环链表空时循环过程结束。 -Description : Let numbered 1, 2, ..., n (NGT; 0) clockwise direction by individuals sitting around a circle, each holding a positive integer code. At the beginning of a given arbitrary reported few limits on m, started from the first clockwise direction from the starting sequence reported a few, when they report back m reported few, hold out the m out from the clockwise direction in the next personal re-order starting from a newspaper; This situation continues until all people so far shown up. Asked to design a simulation of this process, and give out the number of people out sequence. . Algorithm thinking : Jeseph function is to seek to achieve the main function of the algorithm is thinking : m from a right to take the lead in the 19th nodes Listless cycle count, m, the output node number
Date : 2008-10-13 Size : 20.54kb User : 王俊
[CSharp] 030300329jose DL : 0: Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。例如，(7,3)Josephus 排列为3，6，2，7，5，1，4。-Josephus problem with the definition is as follows : Suppose n race who formed a ring. Given a positive integer m, from a certain section of a designated individual, along the Central Counting that every individual section m let out its out and count continue. This process continues until all the people from far out. Finally out of the winners were shown. Everyone out in the order shown in the definition of integers 1, 2, ..., n an order. With this as a (n, m), with Josephus. For example, (7,3) Josephus, were 3,6,2,7,5,1,4.
Date : 2008-10-13 Size : 1.07kb User : 李飞飞
[CSharp] yeshefu DL : 0: 这是一个实现约瑟夫环的功能的程序,用C语言编写的-This is a realization of Josephus the function of the program, prepared by the C language
Date : 2008-10-13 Size : 859byte User : 李文成
[CSharp] yuesehu DL : 0: 此程序在VC界面上能实现约瑟夫环的功能，操作简单，便于用户使用-this procedure in VC interface to achieve Josephus functions, simple and user-friendly
Date : 2008-10-13 Size : 34.23kb User : beibei
[CSharp] jose_seqlist DL : 0: 是一个josephus的应用例子!-Josephus is one example of the application!
Date : 2008-10-13 Size : 1.57kb User : 魏庆成
[CSharp] Josephus DL : 0: Josephus算法，在winform中实现！
Date : 2008-10-13 Size : 13.11kb User : duwei
[CSharp] 啊容 DL : 0: 基于C++的数据结构，用单链表实现约瑟夫环问题，单链表的实现-C-based data structure, to achieve single-Chain Josephus, the realization of single-linked list
Date : 2008-10-13 Size : 3.26kb User : 啊容
[CSharp] 030300329jose DL : 0: Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。例如，(7,3)Josephus 排列为3，6，2，7，5，1，4。-Josephus problem with the definition is as follows : Suppose n race who formed a ring. Given a positive integer m, from a certain section of a designated individual, along the Central Counting that every individual section m let out its out and count continue. This process continues until all the people from far out. Finally out of the winners were shown. Everyone out in the order shown in the definition of integers 1, 2, ..., n an order. With this as a (n, m), with Josephus. For example, (7,3) Josephus, were 3,6,2,7,5,1,4.
Date : 2026-01-09 Size : 1kb User : 李飞飞
[CSharp] yuesehu DL : 0: 此程序在VC界面上能实现约瑟夫环的功能，操作简单，便于用户使用-this procedure in VC interface to achieve Josephus functions, simple and user-friendly
Date : 2026-01-09 Size : 34kb User : beibei
[CSharp] Josephus DL : 0: Josephus算法，在winform中实现！-Josephus algorithm, in WinForm to achieve!
Date : 2026-01-09 Size : 33kb User : duwei
[CSharp] josephus DL : 0: 2、约瑟夫（Josephus）环问题：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为止。建立n个人的单循环链表存储结构，运行结束后，输出依次出队的人的序号。 -2, Joseph (Josephus) Central Question: numbered 1,2,3, ..., n, n individuals sitting clockwise circle, each holding a password (positive integer). An optional start a positive integer as the number of reported upper limit of m, from the first person to embark on the clockwise direction starting from a reported sequence number, to report m stop. Those who reported m out of the column, his password as the new m value, from his home in a clockwise direction, the next began to re-reported from a few, and so it goes, until all of the column until all the up. The establishment of n individual single-loop list storage structure, operation after the end of the output turn out the team' s serial number.
Date : 2026-01-09 Size : 1kb User : linew
[CSharp] Josephus DL : 0: 此源代码用于解决Josephus问题的计算，并帮助初学者有效的学习掌握提高C++编程能力-The source code used to solve the problem of computing Josephus, and to help beginners improve effective learning to master programming skills in C++
Date : 2026-01-09 Size : 1kb User : logionion
[CSharp] Josephus-realizationagt DL : 0: <约瑟夫环的实现>采用线性链表实现可以进行线性表元素的动态插入和删除-< Josephus realization> linear list can be linear table elements dynamically insert and delete
Date : 2026-01-09 Size : 1kb User : 朱术军
[CSharp] Josephus DL : 0: 使用C#编写的约瑟夫环的程序，配合严蔚敏版的《数据结构》中的实习1.2，有界面，运行于.Net 4.0的环境下。-The Josephus program written in C# with Yan Wei-min version of the data structure in the internship 1.2 interface running on Net 4.0 environment.
Date : 2026-01-09 Size : 90kb User : Zombie
[CSharp] Josephus DL : 0: 约瑟夫环问题，用户输入M,N值，从1至N开始顺序循环数数，每数到M输出该数值，直至全部输出。-Josephus, the user input M, N values, each number to the start sequence and cycle count from 1 to N, M output the values, until all the output.
Date : 2026-01-09 Size : 52kb User : 叶知秋
[CSharp] Josephus DL : 0: Josephus问题的各种解决方案，方便大家学习-Josephus problem solutions to facilitate learning
Date : 2026-01-09 Size : 261kb User : 王华
[CSharp] Josephus DL : 0: 约瑟夫（Josephus）环问题：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为止。建立n个人的单循环链表存储结构，运行结束后，输出依次出队的人的序号。-Joseph (Josephus) Central question: numbered 1,2,3, ..., n n individuals clockwise direction around a circle, each holding a password (positive integer). An optional start a positive integer as the upper limit of the number m, from the first person to start a clockwise direction from the beginning of the order number, report m stop. M out of newspaper columns, his password as the new value of m, starting from the next person on his re-clockwise direction from one number off, and so on, until all the columns so far. N round robin to establish a personal list storage structure, after the end of the run, the output sequence number of people out of the team.
Date : 2026-01-09 Size : 1kb User : 程序
[CSharp] Josephus DL : 0: 分别用公式法和链表这两种线性表实现约瑟夫环-Were linked with the formula method and linear table to achieve both Josephus
Date : 2026-01-09 Size : 2.66mb User : 多多
[CSharp] Josephus-problem DL : 0: 该程序能够根据使用者的需要，解决约瑟夫环问题。-The program can be based on user needs,to solve Josephus problem.
Date : 2026-01-09 Size : 167kb User : 湖边赏月
[CSharp] josephus DL : 0: 约瑟夫环具体算法，也就是俗称的土匪杀人算法-Josephus specific algorithm, also known as bandits kill algorithm
Date : 2026-01-09 Size : 34kb User : jolie

« 12 3 »