Bookshelf
Time limit2sMemory limit1024 MB
Given book height h and span r, find the fewest extra books needed so that toppling the leftmost book knocks over the rightmost one.
Statement
Doctor Strange keeps a large library in his mansion. Today he is thinking about the domino effect, and books help with that even if nobody reads them.
The Sorcerer Supreme has an infinite number of ultra-thin books of height . The bookshelf can be viewed as a number line, and books can only be placed at integer coordinates. Wong has already placed books at coordinates and .
A book at coordinate knocks over a book at coordinate when it falls, if at the moment the top point of the first book is at coordinate and height , then . The thickness of a book is negligible.

Strange had to work through possible futures to find the minimum number of books that must be placed between the two original ones, so that pushing the book at coordinate can eventually topple the book at coordinate . Wong does not know this kind of magic, so he asks you to solve this puzzle.
Input
The first line contains one even positive integer , the height of the books ().
The second line contains one positive integer , the coordinate of the rightmost book ().
Output
Print one number: the minimum number of books that must be placed so that pushing the leftmost book can topple the rightmost book.