Python super simple solution to Joseph Ring problem

This article describes the Python super simple solution to Joseph ring problem. Share to everyone for your reference. The specific analysis is as follows:

The question of Joseph's ring is familiar to all. This is the question. A total of 30 persons, numbered from 1-30 sequentially. Every 9 people kicked out a person. Ask the number of the first 15 people to kick out:

The obvious problem with the Joseph Ring is that the Python implementation code is as follows:

?

1 2 3 4 5 6

A = [x for x in range (1,31)] #生成编号 Del_number = 8 #该删除的编号 to I in range: print A[del_number] del A[del_number] Del_ Number = (Del_number + 8)% Len (a)

Here to fix Joseph ring problem python implementation

I hope this article will help you with your Python programming.