Search - josephus

Search - josephus - List

[Other] Josephus问题的顺序表实现 DL : 0: Josephus问题的顺序表实现关于Josephus问题的顺序表实现-Josephus table in the order of Josephus achieve in the order table to achieve
Date : 2026-01-09 Size : 2kb User : 张杰楷
[Other] Josephus算法 DL : 0: 用JAVA写的一个小算法！实现了出局的人数小于循环的人数~！·-using Java to write a small algorithm! Achieved less than the number out of circulation ~!
Date : 2026-01-09 Size : 1kb User : Alan
[Other] josephus DL : 0: 数据结构实验(循环链表josephus问题) 学会选择合适的数据结构来解决实际问题学会如何创建一个循环链表在循环链表中如何进行查找在循环链表中如何进行删除 -Experimental data structure (circular list Josephus problem) Institute of selecting suitable data structure to solve the practical problems to learn how to create a cycle in the cycle list list of how to carry out search in the cycle of how to delete list
Date : 2026-01-09 Size : 2kb User :
[Other] JosephusRing DL : 0: 约瑟夫环问题(Josephus),用户输入M,N值，从1至N开始顺序循环数数，每数到M输出该数值，直至全部输出。由于当某个人退出圆圈后，报数的工作要从下一个人开始继续，剩下的人仍然是围成一个圆圈的，可以使用循环表，由于退出圆圈的工作对应着表中结点的删除操作，对于这种删除操作频繁的情况，选用效率较高的链表结构，为了程序指针每一次都指向一个具体的代表一个人的结点而不需要判断，链表不带头结点。所以，对于所有人围成的圆圈所对应的数据结构采用一个不带头结点的循环链表来描述。设头指针为p，并根据具体情况移动。为了记录退出的人的先后顺序，采用一个顺序表进行存储。程序结束后再输出依次退出的人的编号顺序。由于只记录各个结点的number值就可以，所以定义一个整型一维数组。如：int quit[n] n为一个根据实际问题定义的一个足够大的整数。 -err
Date : 2026-01-09 Size : 1kb User : 金瑶
[Other] Josephus DL : 0: Josephus问题的array实现方式-Josephus ways array problem
Date : 2026-01-09 Size : 6kb User : 江枫
[Other] Josephus DL : 0: Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。-Josephus with the problem are defined as follows: Suppose n a player lined up a ring. Given a positive integer m, from a designated section 1 begins with individuals along the ring count, the first m individuals, when confronted by their let out, and the count continued. This process until all the listed date. Finally a column for the winners. Each person listed in the order of the definition of the integers 1,2, ..., n an order. This arrangement is called a (n, m) Josephus arranged.
Date : 2026-01-09 Size : 1kb User : 刘丹
[Other] Josephus DL : 0: Josephus的实验,用C语言解决这个问题,内含C语言全码-Josephus experiments, using C language to solve this problem, including the entire C language code
Date : 2026-01-09 Size : 8kb User : 陈陈
[Other] josephus DL : 0: 循环链表实现的约瑟夫环，主要语言是c语言，已运行通过仅供参考-Circulation list realize Joseph Central, the main language is c language, has been run through for reference only
Date : 2026-01-09 Size : 1kb User : 牧野叶子
[Other] Josephus DL : 0: This a Josephus Programme! -This a Josephus Programme!
Date : 2026-01-09 Size : 357kb User : chengbing
[Other] Josephus DL : 0: 约瑟夫环（Josephus）问题：古代某法官要判决N个犯人的死刑，他有一条荒唐的法律，将犯人站成一个圆圈，从第S个人开始数起，每数到第D个犯人，就拉出来处决，然后再数D个，数到的在处决……知道剩下的最后一个可赦免。-Central Joseph (Josephus) Question: Ancient N a judge to sentence a prisoner to death, he has a ridiculous law, prisoners stand in a circle, S from the beginning of a number of individuals, each of the first D of the number of prisoners, on the pull out the execution, and then the number of D, and the number of executions of the ... ... know that the last remaining of a pardon.
Date : 2026-01-09 Size : 1kb User : june
[Other] Josephus DL : 0: 数据结构中的Josephus算法，用c语言实现
Date : 2026-01-09 Size : 2kb User : 李灿
[Other] Josephus DL : 0: 约瑟夫环问题：n个人围成一个圈开始报数，报到m的人出列，求出列的次序，并动画显示。-Josephus
Date : 2026-01-09 Size : 53kb User : 杨梅
[Other] Josephus DL : 0: Josephus问题：一群小孩围成一圈，任意假定一个数m，从第一个小孩起，顺时针方向数，每数到第m个小孩是，该小孩便离开。小孩不断离开，圈子不断缩小。最后，剩下的一个小孩便是胜利者。究竟胜利的是第几个小孩呢？提示：用循环链表解答，编写程序link.h实现循环的链表类，由插入与删除等基本操作。 -Josephus problem: a group of kids form a circle, any assumption that a number of m, starting from the first child, the number of clockwise direction, each number to the first m a child is the child and then left. Children continue to leave the circle shrinks. Finally, the remaining child is a winner. What victory is the first of several children feel? Tip: The circular list answers to achieve the cycle of programming link.h list class, from basic operations such as insertions and deletions.
Date : 2026-01-09 Size : 1kb User : 月月
[Other] Josephus DL : 0: 据说著名犹太历史学家 Josephus有过以下的故事：在罗马人占领乔塔帕特后，39 个犹太人与Josephus及他的朋友躲到一个洞中，39个犹太人决定宁愿死也不要被敌人到，于是决定了一个自杀方式，41个人排成一个圆圈，由第1个人开始报数，每报数到第3人该人就必须自杀，然后再由下一个重新报数，直到所有人都自杀身亡为止。然而Josephus 和他的朋友并不想遵从，Josephus要他的朋友先假装遵从，他将朋友与自己安排在第16个与第31个位置，于是逃过了这场死亡游戏。 -Well-known Jewish historian Josephus said to have had the following story: After the Roman occupation Qiaotapate, 39 Jews and Josephus and his friends hid in a hole, 39 Jews were the enemy decided to' d rather die than not to, decided a suicide, 41 people arranged in a circle, starting from the first one reported the number of individuals, each reported the number to 3 people who have to commit suicide, and then re-reported by the next number, until all committed suicide death date. However, Josephus and his friends did not want to comply, Josephus first pretended to follow his friend, he arranged for friends and his 16th with the first 31 positions, so escaped death in this game.
Date : 2026-01-09 Size : 2kb User : Allan
[Other] Josephus DL : 0: 约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。-Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns.
Date : 2026-01-09 Size : 321kb User : 张三
[Other] Josephus DL : 0: 约瑟夫环的问题用链表来实现的可以输入人数退出的号和从第几个人开始计数-Josephus linked list, you can enter the number of exit number and start counting from the first few people
Date : 2026-01-09 Size : 1kb User : 张轩
[Other] Josephus DL : 0: 用C#编的Josephus(约瑟夫斯)问题的源码-the Josephus problem in C#
Date : 2026-01-09 Size : 25kb User : 臧熹
[Other] Josephus DL : 0: 约瑟夫环的实现，本程序可以正确运行，并且能够实现其功能-Josephus realization of the program can be run correctly, and is able to achieve its
Date : 2026-01-09 Size : 1kb User : 周晨
[Other] Josephus DL : 0: 用C++实现约瑟夫环，由用户动态输入密码。有实验报告。-With C++ achieve Josephus, by the users enter a password. Experimental report.
Date : 2026-01-09 Size : 14kb User : 安陌
[Other] The-circular-list-Josephus-problem DL : 0: 循环链表josephus问题。设有n个人围圈，现从第s个人开始报数，数到第m个人出列，然后从出列的下一个人从新开始报数，数到第m个人又出列，如此反复，直到所有人出列-Circular list josephus problem. Suppose there are n individuals in a circle, is from the first s individual reported the number of individuals out to the m-number column, and then the next person from the column and start again reported the number of individuals and the number to the m dequeue, and so forth, until Everyone out of the line
Date : 2026-01-09 Size : 3kb User : taosq

« 12 3 4 5 6 »