Python is super simple to solve the problem of Joseph's ring, and python is super Joseph's ring

Python is super simple to solve the problem of Joseph's ring, and python is super Joseph's ring

This article describes how to solve the Joseph's ring problem using python. Share it with you for your reference. The specific analysis is as follows:

We are all familiar with the Joseph Ring issue. The question is like this. A total of 30 people are numbered from 1 to 30. One person is kicked out every nine people. Find the number of the first 15 people:

The python implementation code is as follows:

A = [x for x in range ()] # generate the number del_number = 8 # The deleted number for I in range (15 ): print a [del_number] del a [del_number] del_number = (del_number + 8) % len ()

Now we can solve the python implementation of the Joseph Ring problem.

I hope this article will help you with Python programming.