3701.Point on Spiral

Time Limit: 1s Memory Limit: 256MB

Valera the horse lives on a plane. The Cartesian coordinate system is defined on this plane. Also an infinite spiral is painted on the plane. The spiral consists of segments: [(0,0),(1,0)], [(1,0),(1,1)], [(1,1),(-1,1)], [(-1,1),(-1,-1)], [(-1,-1),(2,-1)], [(2,-1),(2,2)] and so on. Thus, this infinite spiral passes through each integer point of the plane.

Valera the horse lives on the plane at coordinates (0,0). He wants to walk along the spiral to point (x,y). Valera the horse has four legs, so he finds turning very difficult. Count how many times he will have to turn if he goes along a spiral from point (0,0) to point (x,y).

Input Format(From the terminal/stdin)

The first line contains two space-separated integers x and y (|x|,|y| \le 100).

Output Format(To the terminal/stdout)

Print a single integer, showing how many times Valera has to turn.

Sample Input 1

Copy
0 0
 · \n

Sample Output 1

Copy
0
 \n

Sample Input 2

Copy
1 0
 · \n

Sample Output 2

Copy
0
 \n

Sample Input 3

Copy
0 1
 · \n

Sample Output 3

Copy
2
 \n

Sample Input 4

Copy
-1 -1
  ·  \n

Sample Output 4

Copy
3
 \n

Submit

请先 登录

© 2025 FAQs