# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
![]() pratikmoona
|
13 years ago,
#
|
![]() ![]() The concept is very simple...
Assuming that there no. of boys (b) < no. of girls (g), then, we have b + 1 places where we can fills groups of girls. To minimize the number of girls in a line, we shall try to distribute them equally, i.e., g / (b + 1) girls everywhere. If g % (b + 1) != 0, then we shall distribute g % (b + 1) girls in those many places and the answer then becomes g / (b + 1) + 1. Trivial cases, g = b, answer is 1. g or b = 0, answer is b or g respectively.
→
Reply
|
Name |
---|