GIRLSNBS - Girls and Boys
There are G girl students and B boy students in a class that is about to graduate. You need to arrange them in a single row for the graduation. To give a better impression of diversity, you want to avoid having too many girls or too many boys seating consecutively. You decided to arrange the students in order to minimize the gender regularity. The gender regularity of an arrangement is the maximum number of students of the same gender (all girls or all boys) that appear consecutively. Given G and B, calculate the minimum gender regularity among all possible arrangements.
Each test case is described using a single line. The line contains two integers G and B representing the number of girls and boys in the class, respectively (0 ≤ G, B ≤ 1000). The end of input is indicated with a line containing the number −1 twice.
For each test case, output a single line with a single integer representing the minimum gender regularity that an arrangement of G girls and B boys can have.
Simple pigeon hole. Not expected as a SPOJ level problem.
Last edit: 2021-03-14 13:15:27
YES take care of 0 0
take care of 0 0 took me 10 mins to figure out
I was not able to do this by using Pigeon Hole Principle (intentionally) but I rather simulated the whole process because constraints are small.
Try using pigeon hole concept, learned something new and really cool, take your time and understand the concept
Actually implemented it as I was seeing a pattern.
pigeon hole :)))))