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.
figured it out using test cases...simple one :)
Lots of paper work needed. Try on your own !!!
18 lines in python3
AC in one go without knowing pigeonhole principle !
Pigeonhole and some thinking gives it away.
not that easy question....teaches you Pigeon Hole Principle
don't forget to use double if using ceil() , costed me many wrong answers
pigeonhole principle !!
AC in one go very simple math needed
AC in one go!!