10 recommended articles about the King

Today I will implement a Joseph Ring algorithm. The following is an interview question from Sina: m monkeys sit in a circle, numbered from 1 to m in a clockwise direction. Then start counting from monkey No. 1 in a clockwise direction from 1, and the n monkey is out. Then count again from the next position of the monkey who just got out. Repeat this until there is only one monkey left, which is the king. Design and write a program to achieve the following functions: (1) The user is required to input the monkey number m at the beginning and the last number n reported. (2) Give the initial number of the elected Monkey King. This question is a typical Joseph Ring problem, the "monkey chooses the king" problem. Note: This example passed the test under python2.7, but was not tested under python3. Interested students can communicate in the group and code directly: #!/usr/bin/python #coding=utf-8 #Joseph Ring Algorithm - Monkey Choosing the King Problem ​ def king(m,n): dd&

1. Recommended courses on the monkey king selection process

##Introduction: Today I will implement a Joseph ring algorithm. The following is an interview question from Sina: m monkeys sit in a circle, numbered clockwise from 1 to m. Then start counting from monkey No. 1 in a clockwise direction from 1, and the n monkey is out. Then count again from the next position of the monkey who just got out. Repeat this until there is only one monkey left, which is the king. Design and write a program to achieve the following functions: (1) The user is required to input the monkey number m at the beginning and the last number n reported. (2) Give the initial number of the elected Monkey King. This question is a typical Joseph ring problem, "The monkey chooses the king...

2. "The monkey chooses the king" algorithm python implementation

Introduction: "Monkey chooses the king" algorithm python implementation

3. php Monkey Choosing the King

Introduction:: This article mainly introduces PHP Monkey Choosing the King. Students who are interested in PHP tutorials can refer to it #.

##4.

Popular understanding of PHP monkey chooses the king

Introduction:: This article mainly introduces the popular understanding of PHP monkey chooses the king, for PHP tutorials Interested students can refer to it

##5.

PHP implementation of monkey king problem algorithm example_PHP tutorial

# #Introduction: PHP implements the monkey-choose-the-king problem algorithm example. PHP implements the monkey-choose-the-king problem algorithm example. This article describes the PHP implementation of the monkey-choose-the-king problem algorithm. Share it with everyone.

#6. PHP implements monkey king problem algorithm example, Monkey King_PHP tutorial

Introduction: PHP implements monkey election Example of the algorithm for the king problem, Monkey King. Example of the algorithm for the monkey to choose the king problem in PHP. This article describes the algorithm for the monkey to choose the king problem. The specific analysis is as follows: 1. Question

7. php monkey chooses the king problem solution, monkey king_PHP tutorial

Introduction: php monkey chooses the king problem solution, Monkey King. The solution to the problem of monkey choosing the king in php. The monkey king gives an example of the solution to the problem of monkey choosing the king in php. The specific analysis is as follows: Problem description:

# #8.

Monkey chooses the king, monkey king_PHP tutorial

## Introduction: Monkey chooses the king, monkey king A group of monkeys line up. Circle, number them in sequence according to 1, 2, and n. Then start counting from the 1st one, count to the mth one, kick it out of the circle, and start counting from behind it, and then count to .

9. PHP object-oriented writing method for counting three and retreating 1

Introduction: PHP object-oriented writing method for counting three and retreating 1 ​

10. Linked list solution and mathematical solution (PHP) to problems related to Joseph ring

Introduction: Linked list solution and mathematical solution to the Joseph Ring Problem (PHP) Joseph Ring Problem A group of monkeys line up in a circle and are numbered according to 1, 2,..., n. Then start counting from the 1st one, count to the mth one, kick it out of the circle, start counting from behind it, count to the mth one, kick it out..., and continue in this way until the end. Until there is only one monkey left, that monkey is called the king. Programming is required to simulate this process, input m, n, and output the number of the last king. Linked list solution function king($n,

The above is the detailed content of 10 recommended articles about the King. For more information, please follow other related articles on the PHP Chinese website!