mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-08 02:04:31 +08:00
@ -1,15 +1,21 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
/** There are n friends that are playing a game. The friends are sitting in a circle and are numbered from 1 to n in clockwise order. More formally, moving clockwise from the ith friend brings you to the (i+1)th friend for 1 <= i < n, and moving clockwise from the nth friend brings you to the 1st friend.
|
||||
/**
|
||||
* There are n friends that are playing a game. The friends are sitting in a circle and are
|
||||
* numbered from 1 to n in clockwise order. More formally, moving clockwise from the ith friend
|
||||
* brings you to the (i+1)th friend for 1 <= i < n, and moving clockwise from the nth friend brings
|
||||
* you to the 1st friend.
|
||||
*/
|
||||
|
||||
/** The rules of the game are as follows:
|
||||
/**
|
||||
The rules of the game are as follows:
|
||||
|
||||
1.Start at the 1st friend.
|
||||
2.Count the next k friends in the clockwise direction including the friend you started at. The counting wraps around the circle and may count some friends more than once.
|
||||
3.The last friend you counted leaves the circle and loses the game.
|
||||
4.If there is still more than one friend in the circle, go back to step 2 starting from the friend immediately clockwise of the friend who just lost and repeat.
|
||||
5.Else, the last friend in the circle wins the game.
|
||||
2.Count the next k friends in the clockwise direction including the friend you started at.
|
||||
The counting wraps around the circle and may count some friends more than once. 3.The last friend
|
||||
you counted leaves the circle and loses the game. 4.If there is still more than one friend in the
|
||||
circle, go back to step 2 starting from the friend immediately clockwise of the friend who just
|
||||
lost and repeat. 5.Else, the last friend in the circle wins the game.
|
||||
|
||||
@author Kunal
|
||||
*/
|
||||
|
Reference in New Issue
Block a user