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.
Input
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.
Output
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.
Example
Input:
10 10
5 1
0 1000
1 1
Output:
1
3
1000
hide comments
yashrocks22:
20170529 23:29:48
Simple pigeonhole principle!! 

preetham_7399:
20170423 09:05:53
AC in one go .., Just paper work needed .., 

dileep9259:
20170322 20:22:44
Nothing much....Just a little thinking... be practical... :P 

shiv pratap singh:
20170317 16:30:14
very simple problem just we have to do division Last edit: 20170317 16:30:32 

pushkars:
20170309 19:12:50
Test Case (0,0) cost me two WA's...nice one 

rohan2802:
20170304 18:47:00
It looked tough initially to me.Thought that required combinatrics . Finally turned out to be an adhoc. Nice logic a bit of brainstorming required. 

nilabja16180:
20170214 09:01:02
Beware of cases where a and b is 0 

scorpion_ajay:
20170105 15:59:39
beware of the permutations, nice logic :) 

pawanshaw12:
20161207 17:20:47
@baadshah_ i passed all your test case but still I got WA. :( 

syed_tanveer:
20161127 08:25:38
Easy one. Read it second time. Got in less than 5 minutes. AC in a go.

Added by:  Pablo Ariel Heiber 
Date:  20100927 
Time limit:  2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 NODEJS OBJC VB.NET 
Resource:  FCEyN UBA ICPC Selection 2010 