Location:
Search - JosephusProblem
Search list
Description: 據說著名猶太歷史學家 Josephus有過以下的故事：在羅馬人佔領喬塔帕特後，39 個猶太人與Josephus及他的朋友躲到一個洞中，39個猶太人決定寧願死也不要被敵人到，於是決定了一個自殺方式，41個人排成一個圓圈，由第1個人開始報數，每報數到第3人該人就必須自殺，然後再由下一個重新報數，直到所有人都自殺身亡為止。
然而Josephus 和他的朋友並不想遵從，Josephus要他的朋友先假裝遵從，他將朋友與自己安排在第16個與第31個位置，於是逃過了這場死亡遊戲。
Platform: |
Size: 3981 |
Author: 王凌云 |
Hits:
Description: 约瑟夫生死者问题的c++实现。建立了处理问题的模板。
Platform: |
Size: 8787 |
Author: 桂正科 |
Hits:
Description: 约瑟夫问题的两种解法
设有n个人围坐在一个圆桌周围，先从第s个人开始报数，数到第m个人出列，然后从出列的下一个人重新开始报数，数到第m个人又出列……如此重复，直到所有的人出列为止。本程序分别用链式存储结构（循环链表）和顺序存储结构（数组）解决约瑟夫问题，可供初学者辨别这两种存储结构的异同
用户输入：n,s,m（逗号隔开）
输出：出列顺序表
Platform: |
Size: 1093 |
Author: XY Z |
Hits:
Description: 據說著名猶太歷史學家 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.
Platform: |
Size: 4096 |
Author: 王凌云 |
Hits:
Description: 约瑟夫生死者问题的c++实现。建立了处理问题的模板。-Joseph s life and death issue c++ Achieve. Set up templates to deal with the problem.
Platform: |
Size: 238592 |
Author: 桂正科 |
Hits:
Description: 约瑟夫问题的两种解法
设有n个人围坐在一个圆桌周围，先从第s个人开始报数，数到第m个人出列，然后从出列的下一个人重新开始报数，数到第m个人又出列……如此重复，直到所有的人出列为止。本程序分别用链式存储结构（循环链表）和顺序存储结构（数组）解决约瑟夫问题，可供初学者辨别这两种存储结构的异同
用户输入：n,s,m（逗号隔开）
输出：出列顺序表
-Joseph problems with n solution of two individuals sitting around in a round-table, starting with the first s individuals started off, a few individuals out to the first m out, and then a column from the next person to start off, a few to the first m another person out ... so ... repeat until all of the people out so far. This procedure, respectively, with chain storage structure (circular list), and the order of the storage structure (array) to resolve the issue of Joseph, for beginners to identify both the similarities and differences between storage structure user input: n, s, m (comma separated) output : out out the order form
Platform: |
Size: 1024 |
Author: XY Z |
Hits:
Description: Josephus problem 的实现程序-the realization of the Josephus problem
Platform: |
Size: 1024 |
Author: shenyao |
Hits:
Description: 这是约瑟夫问题,用循环链表实现的,其代码用头文件写出-This is Joseph problems linked with the implementation cycle, the code is written with the header file
Platform: |
Size: 1024 |
Author: liu |
Hits:
Description: Josephus 问题的算法，在一船上有n人，需要救m人，n个人围成一圈，相隔k个人就丢掉一个，直到只剩下m个人-Josephus problem algorithm, there are n people in a boat, people need to save m, n people form a circle, separated by k individuals to lose one, until only the m individual
Platform: |
Size: 1024 |
Author: dengxianzhi |
Hits:
Description: 用C程序解决约瑟夫斯问题，是一个出现在计算机科学和数学中的问题。在计算机编程的算法中，类似问题又称为约瑟夫环。-In computer science and mathematics, the Josephus Problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game.
Platform: |
Size: 99328 |
Author: 王旺 |
Hits:
Description: Josephus problem in Java
Platform: |
Size: 17408 |
Author: maya333888 |
Hits: