Problem Statement
There are numMales males and numFemales females arranged in a circle. Starting from a given point, you count clockwise and remove the K'th person from the circle (where K=1 is the person at the current point, K=2 is the next person in the clockwise direction, etc...). After removing that person, the next person in the clockwise direction becomes the new starting point. After repeating this procedure numFemales times, there are no females left in the circle.
Given numMales, numFemales and K, your task is to return what the initial arrangement of people in the circle must have been, starting from the starting point and in clockwise order.
For example, if there are 5 males and 3 females and you remove every second person, your return String will be "MFMFMFMM".
Definition
- Class:
- PeopleCircle
- Method:
- order
- Parameters:
- int, int, int
- Returns:
- String
- Method signature:
- String order(int numMales, int numFemales, int K)
- (be sure your method is public)
Constraints
- numMales is between 0 and 25 inclusive
- numFemales is between 0 and 25 inclusive
- K is between 1 and 1000 inclusive
Examples
5
3
2
Returns: "MFMFMFMM"
Return "MFMFMFMM". On the first round you remove the second person - "M_MFMFMM". Your new circle looks like "MFMFMMM" from your new starting point. Then you remove the second person again etc.
7
3
1
Returns: "FFFMMMMMMM"
Starting from the starting point you remove the first person, then you continue and remove the next first person etc. Clearly, all the females are located at the beginning. Hence return "FFFMMMMMMM"
25
25
1000
Returns: "MMMMMFFFFFFMFMFMMMFFMFFFFFFFFFMMMMMMMFFMFMMMFMFMMF"
4
1
7
Returns: "MFMMM"
3
2
7
Returns: "MFMMF"
5
1
6
Returns: "MMMMMF"
20
25
45
Returns: "FFFFMFMMMFMMFFFFFFFFFMMFFMMFFMMMFMFFFMMMMFMMF"
7
3
10
Returns: "FMFMMMMMMF"
0
2
1000
Returns: "FF"
2
0
999
Returns: "MM"
0
0
998
Returns: ""
5
5
3
Returns: "MFFMMFFMFM"
Here we mark the removed people with '_', and the starting position with lower-case: Number of | People Remaining Rounds | (in initial order) ---------------+----------------- 0 | mFFMMFFMFM 1 | MF_mMFFMFM 2 | MF_MM_fMFM 3 | MF_MM_FM_m 4 | M__mM_FM_M 5 | M__MM__m_M
1
0
245
Returns: "M"
0
1
23
Returns: "F"
1
1
1
Returns: "FM"
1
1
5
Returns: "FM"
25
0
1000
Returns: "MMMMMMMMMMMMMMMMMMMMMMMMM"
25
25
999
Returns: "MFMMFMFFFFFMFFFFMFFMFMMMFMFMMMMMMMMFMFFFMFFMMMFFFM"
1
25
10
Returns: "FFFFFFFFFFFFFFFMFFFFFFFFFF"
1
25
1000
Returns: "FFFFFFFFFFFFMFFFFFFFFFFFFF"
14
14
32
Returns: "MFMFFFMFFFFMFMFMMFMMMFMMFMFM"
17
19
111
Returns: "FFFMMFFMFFFMFMFMFFFFMMMFFMMFMFFMMMMM"
5
5
3
Returns: "MFFMMFFMFM"
25
25
1000
Returns: "MMMMMFFFFFFMFMFMMMFFMFFFFFFFFFMMMMMMMFFMFMMMFMFMMF"
3
3
100
Returns: "MFFFMM"
5
5
15
Returns: "FMMFFMMMFF"
5
5
37
Returns: "MMFMFFFFMM"
0
1
1
Returns: "F"
5
5
30
Returns: "FFFMMMMMFF"
0
0
1000
Returns: ""
2
0
2
Returns: "MM"
0
1
2
Returns: "F"
5
4
100
Returns: "FMFMFMFMM"
0
0
1
Returns: ""
25
25
997
Returns: "MFFFMMMMFFMFMFMMFMFMMMFMFFMFFMFMFFFMMMFMMFFFFMFMMF"