How to use algorithm to create Monkey King selection Game

This article mainly introduces "how to use the algorithm to create the monkey king game". In the daily operation, I believe that many people have doubts about how to use the algorithm to create the monkey king game. The editor consulted all kinds of materials and sorted out the simple and useful operation method. I hope it will be helpful for everyone to answer the question of "how to use the algorithm to create the monkey king game". Next, please follow the editor to study!

Problem description

A group of monkeys form a circle, press 1pm 2pm 3,. , m is numbered sequentially.

Then count from the first, count to the nth, tick it out, and then start counting again.

If it goes on like this, the last one left is the king.

Solution

Topic analysis: the core idea of this topic is a Joseph ring algorithm, which uses the while loop to take out the monkey one by one and use the I label, and then judge whether I is the number to be removed, add a new list and wait for the next cycle without elimination, and continue to add I to the cycle until there is only the last monkey.

Def king (m, n):

Lt = list (range (1, mu 1))

I = 0

While len (lt) > 1:

Monkey = lt.pop (0)

I + = 1

If I = = n:

I = 0

Else:

Lt.append (monkey)

Return lt [0]

M = int (input ('Please enter the total number of monkeys:')

N = int (input ('Please enter the value of n:')

Print (king (m, n))

At this point, the study on "how to use the algorithm to create a monkey king game" is over. I hope to be able to solve everyone's doubts. The collocation of theory and practice can better help you learn, go and try it! If you want to continue to learn more related knowledge, please continue to follow the website, the editor will continue to work hard to bring you more practical articles!