A tutorial on the method of solving Joseph Ring in php
This article mainly explains the "php method to solve Joseph ring tutorial", the content of the article is simple and clear, easy to learn and understand, the following please follow the editor's train of thought slowly in depth, together to study and study the "php method to solve Joseph ring tutorial"!
The Joseph problem (sometimes known as Josephus permutation) is a problem that appears in computer science and mathematics. In computer programming algorithms, similar problems are also known as Joseph rings. Also known as the problem of losing handkerchiefs.
A group of monkeys, all with numbers, stood in a circle, counted to m's shooting, and then counted the rest. Over and over again, the rest of the dead goes crazy.
The copy code is as follows:
