402375: GYM100739 I Red and yellow
Memory Limit:64 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
I. Red and yellowtime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard output
You can have one red circle with radius in the range [A;B] and unlimited number of yellow circles with radius R. Task is to put all circles in a way that each yellow circle touches 2 other yellow circles and 1 red circle. A circle cannot be inside another circle. Calculate how many different real sizes (X) of the red circle radius can satisfy this condition.
InputA single line contains 3 integers A, B and R. (1 ≤ A, B, R ≤ 107, A ≤ B)
OutputPrint a single integer X.
ExamplesInput2 2 2Output
1Input
1 2 2Output
2