CF279A.Point on Spiral

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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)][(0,0),(1,0)] , [(1,0),(1,1)][(1,0),(1,1)] , [(1,1),(1,1)][(1,1),(-1,1)] , [(1,1),(1,1)][(-1,1),(-1,-1)] , [(1,1),(2,1)][(-1,-1),(2,-1)] , [(2,1),(2,2)][(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)(0,0) . He wants to walk along the spiral to point (x,y)(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)(0,0) to point (x,y)(x,y) .

输入格式

The first line contains two space-separated integers xx and yy (x,y<=100)(|x|,|y|<=100) .

输出格式

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

输入输出样例

  • 输入#1

    0 0
    

    输出#1

    0
    
  • 输入#2

    1 0
    

    输出#2

    0
    
  • 输入#3

    0 1
    

    输出#3

    2
    
  • 输入#4

    -1 -1
    

    输出#4

    3
    
首页