2690.A Problem about Polyline

Time Limit: 1s Memory Limit: 256MB

There is a polyline going through points (0,0)—(x,x)—(2x,0)—(3x,x)—(4x,0)—...-(2kx,0)—(2kx+x,x)—.... We know that the polyline passes through the point (a,b). Find minimum positive value x such that it is true or determine that there is no such x.

Input Format(From the terminal/stdin)

Input Only one line containing two positive integers a and b (1 \le a,b \le 109).

Output Format(To the terminal/stdout)

Output Output the only line containing the answer. Your answer will be considered correct if its relative or absolute error doesn't exceed 10-9. If there is no such x then output -1 as the answer.

Sample Input 1

Copy
3 1
 · \n

Sample Output 1

Copy
1.000000000000
              \n

Sample Input 2

Copy
1 3
 · \n

Sample Output 2

Copy
-1
  \n

Sample Input 3

Copy
4 1
 · \n

Sample Output 3

Copy
1.250000000000
              \n

Hints

You can see following graphs for sample 1 and sample 3. 2690_1.png2690_2.png

Submit

请先 登录

© 2025 FAQs