joseph ring

The Joseph Ring is a mathematical application problem: it is known that n people (represented by numbers 1, 2, 3...n respectively) are sitting around a round table. Start counting from the person numbered k, and the person who counts to m comes out of the queue; the next person starts counting from 1, and the person who counts to m comes out of the queue again; repeat this pattern until around the round table All the people came out.
                 
                                                                                                                                                                                                                                                                                                                     

 $monkey = range(1, $n);//Simulate a continuous array
 $i = 0;
 while (count($monkey) > ;= 1)
                                                                                                                                                                                                                                                                                                ; )
                                        array_push($monkey,                                                                                                                                                       [] = $head;
 }
 }
 Return $out;
}
$out = king(9, 5);
print_r($out);


Copy code