jackfrued / jackfrued/Python-100-Days
Day07综合案例2：约瑟夫环问题 简单解法
Open
Nobody has claimed this yet.
- Dominant language
- Jupyter Notebook
- Stars
- 187k
- Forks
- 55.8k
- PR merge metrics
- No merged PRs in 30d
Description
def main():
persons = [x for x in range(1, 31)]
dropped = 0
while (dropped < 15):
persons = persons[9:] + persons[0:8]
dropped += 1
print ('基督徒的原始位置为：')
print (sorted(persons))
if __name__ == '__main__':
main()
建立一个序号列表，每次从列表中去除一个，最终剩下的就是需要的结果
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names the Day07 Josephus example and its main() entry point, but no repository file or requested change. Locate the lesson or example containing this code and read its surrounding material; confirm the intended change with the maintainer before editing, because no completion condition or test is given.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- content
- Issue type
- Documentation
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100