Python super simple solution to Joseph Ring problem

Source: Internet
Author: User

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.

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.