toj_2818_1.cpp

来自「Tianjin University Online Judge 的80多道题目 」· C++ 代码 · 共 27 行

/*2818.   Prairie dogs IV Time Limit: 10.0 Seconds   Memory Limit: 65536K
Total Runs: 116   Accepted Runs: 74


Oh, my God! The lovely prairie dogs come again! We know they are very naughty and always play some funny games. This time, they play a game named Spiral Queue.

Each of the prairie dogs has a number and they stand in a funny queue named Spiral Queue like in Figure 1.

Given the coordinate, the direction of x-axis and y-axis is indicated in Figure 2. We suppose the coordinate of 1 is (0,0), then the coordinate of 2 is (1,0), the coordinate of 3 is (1,1) and the coordinate of 7 is (-1,-1).

21   22  ...
20   7   8   9  10
19   6   1   2  11
18   5   4   3  12
17  16  15  14  13
      
      Figure1

Find out the laws of the Spiral Queue.

Your task is here: Given x and y (-1000 ≤ x,y ≤ 1000), the coordinate of a prairie dog, try to find out the number of the prairie dog.

Inpu*/
#include<cstdio>

int main()