Location:
Search - Joseph a
Search list
Description: < Embedded Computing: A VLIW Approach to Architecture, Compilers and Tools>>
by Joseph A. Fisher ,Paolo Faraboschi ,Cliff Young
Platform: |
Size: 4200254 |
Author: mp |
Hits:
Description: 2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的人对应的号码。 2.2用单向循环链表实现操作。-2.1 n personal cordons m not yet entered the game before the first yards out for the first out, then eliminated were given the password, the password to determine under which a one-out, and turn out the output of the corresponding number. 2.2 List circle with a one-way operation to achieve.
Platform: |
Size: 49576 |
Author: 苏亮 |
Hits:
Description: 绝对可以运行的程序 约瑟夫问题1-definitely can run the procedure Joseph a problem
Platform: |
Size: 53248 |
Author: 涛涛 |
Hits:
Description: 2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的人对应的号码。 2.2用单向循环链表实现操作。-2.1 n personal cordons m not yet entered the game before the first yards out for the first out, then eliminated were given the password, the password to determine under which a one-out, and turn out the output of the corresponding number. 2.2 List circle with a one-way operation to achieve.
Platform: |
Size: 49152 |
Author: 苏亮 |
Hits:
Description: < Embedded Computing: A VLIW Approach to Architecture, Compilers and Tools>>
by Joseph A. Fisher ,Paolo Faraboschi ,Cliff Young-<Embedded Computing: A VLIW Approach to Architecture, Compilers and Tools>> by Joseph A. Fisher, Paolo Faraboschi, Cliff Young
Platform: |
Size: 4200448 |
Author: mp |
Hits:
Description: 编号1,2,...n的n个人按顺时针方向围坐在一圈,每人持有一个密码.一开始任选一个正整数作为报数上限值m,从第一个开始按顺时针方向自1开始顺序报数,报到m时停止报数.报m的人出列,将他的密码作为新的m值,从他在顺时针方向上的下一个人开始重新从1报数,如此下去,直至所有人全部出列为止.-No. 1,2, ... n of the n individuals in a clockwise direction around a circle, one person holding a password. One began to choose a positive integer as the number of reported upper limit m, from the first to embark on the clockwise direction since the beginning of the order of one off, back off m stop. reported m the person out of his password as the new m value, from him in a clockwise direction on the next person started to count off from one, it goes on like this until all the column until all.
Platform: |
Size: 1024 |
Author: lq |
Hits:
Description: 数据结构常用算法，用vc++实现的约瑟夫环问题-Data structure commonly used algorithms, with vc++ Realize Joseph Central issues
Platform: |
Size: 1024 |
Author: mm |
Hits:
Description: 用顺序存储得方实现约瑟夫问题，完成输入给定得个数与每次走得步书，并打印出结果-With a side order of storage realize Joseph problems, the completion of input to set the number of step-by-step walk with each book, and print out the results of
Platform: |
Size: 1024 |
Author: pu |
Hits:
Description: 约瑟夫（Joseph）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序。-Joseph (Joseph) a description of the problem is: No. 1,2, ..., n the n individuals according to a clockwise direction around a circle, one person holding a password (positive integer). Began to choose a positive integer, as reported a few upper limit m, from the first individual to embark on the clockwise direction since the beginning of the order of 1 reported that the number of reported m stop off. Reported m the person out of his password as a new m value, from his in a clockwise direction on the next person to start off again from the 1, and so on, until all that out until all. Try to design a procedure to derive the column order.
Platform: |
Size: 3072 |
Author: 小海 |
Hits:
Description: 题目：约瑟夫环问题
一．问题描述
设有n个人围做一圈，现从某个人开始报数，数到m的人出列，接着从出列的下一个人开始重新报数，数到m的人又出列，如此下去，直到所有人都出列为止。试设计确定他们的出列次序序列的程序。
-Title: Joseph Central issues 1. Description of the problem has to do lap Wai n individuals, are reported from a few individuals to start, a few people out of the m out, and then a column from the next re-reported the number of individuals, several of the m out of people, so until all that far out. Test designed to determine whether they should set out the order of a sequence of procedures.
Platform: |
Size: 1024 |
Author: wangshujing |
Hits:
Description: 可以循环实现约瑟夫环功能。利用单向循环连表存储结构模拟此过程，按照出列的顺序印出各人的编号-Joseph Ring can realize the functional cycle. Using one-way cycle even table storage structure simulation of this process, in accordance with a print out the order of their numbering
Platform: |
Size: 3072 |
Author: 杨勇 |
Hits:
Description: 本程序主要是约瑟夫问题。输入为总人数，然后分别输入每人的密码，最后输入第一次报数的上限。输出则是按出列的先后顺序输出编号。
实例
输入为
7
3 1 7 2 4 8 4
6
则对应输出为6 1 4 7 2 3 5-This procedure is the main problem Joseph. The total number of input, and then enter the password for each, and finally enter the number first reported that the upper limit. Output is shown by a sequence of output numbers. Examples of input 731,724,846 for the corresponding output of 6,147,235
Platform: |
Size: 15360 |
Author: 尹素芳 |
Hits:
Description: 约瑟夫问题新解
A New Interpretation of the question, Joseph-A New Interpretation of the question, Joseph
Platform: |
Size: 3072 |
Author: jiangke |
Hits:
Description: acm 北大1012用来处理Joseph问题，通过模拟枚举实现，算法高效！-acm Peking University 1012 to handle Joseph problems, achieved by simulating the enumeration, algorithms and efficient!
Platform: |
Size: 164864 |
Author: 徐飞 |
Hits:
Description: 约瑟夫环
约瑟夫问题的一种描述是：编号为1，2，3……的n个人按顺时针方向围坐成一圈，每人持有一个密码。一开始任选一个正整数作为报数上限m，从第一个人开始按顺时针方向自1开始报数，报到m停止报数。报m的人出列，将他的密码作为新的m值，从他顺时针方向的下一个人开始重新从1开始报数，如此下去，直到所有人全部出列。-Joseph Ring
Joseph, a description of the problem is: numbered 1,2,3 ... ... n-individuals sitting in a circle clockwise, each holding a password. Choose a positive integer beginning, as the reported maximum number of m, from the first individual to embark on the clockwise direction starting from a report number, report the number m to stop reporting. Who reported m out of the column, his password as the new m value, from his next person clockwise to re-start from a number of reports, this continues until all the listed owner.
Platform: |
Size: 1024 |
Author: angela |
Hits:
Description: 约瑟夫问题，四种解法，分别是静态链表，顺序表两种和循环链表-Joseph problems, the four solution, namely a static list, order form and the cycle of two lists
Platform: |
Size: 3072 |
Author: daiminmin |
Hits:
Description: 约瑟夫环（Joseph）问题的一种描述是：编号1，2，┉，n的n个人按顺时针方向围坐一圈，每个人持有一个密码（正整数），一开始，任选一个正整数作为报数上线值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1开始报数，如此下去，直至所有人全部出列为止。设计一个程序求出出列顺序。-Joseph Ring (Joseph) a description of the problem is: No. 1,2, ┉, n of n individuals sitting around a circle clockwise, each person has a password (positive integer), the start and either a positive integer value, as reported on line number m, from the first individual to embark on the clockwise direction starting from an order of the number reported, report the number of m, to stop reporting. Who reported m dequeuing his password as the new m value, clockwise from him the next person on the re-start at 1 count off, it goes on, until the owner of all the columns up. Design a program calculated the column order.
Platform: |
Size: 1024 |
Author: 木清澄 |
Hits:
Description: 约瑟夫(Joseph)问题的一种描述是:编号为1,2,..., n 的n 个人按顺
时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作为报数上限值m， 从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将它的密码作为新的m值，再从下个人开始新一轮报数，如此反复，直到剩下最后一人则为获胜者。试设计一个程序求出出列顺序。-Joseph (Joseph) a description of the problem is: numbered 1,2 ,..., n of n individuals sitting around a circle clockwise, each holding a password (positive integer). The beginning of a positive integer as the selection of the number of reported upper limit of m, starting from the first person clockwise order starting from a number of newspaper, newspaper to report the number of m to stop. Who reported m out of line, it' s password as the new m value, and then start a new one from the reported number of individuals, and so forth, until the last one remaining was the winner. Design a program list find out the order.
Platform: |
Size: 31744 |
Author: enela |
Hits:
Description: 约瑟夫环（Joseph）问题的一种描述是：编号为1、2、3……n的n个人按照顺时针方向围坐一圈，没人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按照顺时针的方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他的顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序。-Josephus (Joseph) a description of the problem is: No. 1, 2, 3 ..., the n individuals sitting around the circle clockwise, no one holds a password (positive integer). One began to Choose a positive integer as the reported number of the upper limit of m, starting from the first person since the number of a start sequence reported in accordance with the clockwise direction, the report m stop the reported number. Reported m the person out of the line, his password as the new values of m, starting from the next person in the clockwise direction from a number off again, and so on, until all all columns so far. Try to design a program to calculate the column order.
Platform: |
Size: 140288 |
Author: 吴坤 |
Hits:
Description: 约瑟夫(Joseph)问题的一种描述是:编号为1,2,..., n 的n 个人按顺
时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作
为报数上限值m， 从第一个人开始按顺时针方向自1开始顺序报数，报到m时
停止报数。报m的人出列，将它的密码作为新的m值，再从下个人开始新一轮
报数，如此反复，直到剩下最后一人则为获胜者。试设计一个程序求出出列顺
序。-Joseph (Joseph) a description of the problem is: the number is 1,2,..., n n
Around a circle, each holding a password (positive integer). A selection of a positive integer as
As the number of upper limit of M, starting the first person in a clockwise direction 1 to the beginning of the order number, report m
Stop off. Who reported m out of line, it will be the password as the new m value, the individual to start a new round of
Off, so repeatedly, until the last one is the winner. Try to design a program obtained along the column
Order.
Platform: |
Size: 1024 |
Author: zhujiei |
Hits:
« 12
3
4
5
6
7
8
9
10
...
20
»