C Number Steps SDUT

---

Problem Description

Starting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,… as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1), (2,0), and (3, 1) respectively and this pattern has continued.

You are to write a program that reads the coordinates of a point (x, y), and writes the number (if any) that has been written at that point. (x, y) coordinates in the input are in the range 0…5000.

---

Input

The first line of the input is N, the number of test cases for this problem. In each of the N following lines, there is x, and y representing the coordinates (x, y) of a point.

---

Output

For each point in the input, write the number written at that point or write No Number if there is none.

---

Sample Input

3
4 2
6 6
3 4

---

Sample Output

6
12
No Number

Hint

---

Source
Tehran 2000

---

本题如果使用二维数组储存坐标轴的每一个点再进行计算，需要的空间会很大，而本题中要求的空间大小却比其他题目所允许的空间小，所以这样可能会超内存，所以可以观察坐标和结果的关系

#include <stdio.h>
#include <string.h>

int main()
{

   int n,x,y;
   scanf("%d",&n);

   while (n--)
   {
       scanf("%d%d",&x,&y);
       if (x == y)
        //当横纵坐标相等时；
       {
           if (x % 2 == 0)
           //如果坐标是偶数；
           {
               printf("%d\n",2 * x);
           }
           else
           //如果坐标是奇数；
           {
               printf("%d\n", (2 * x) - 1);
           }
       }
       else if (y == (x - 2))
       //如果纵坐标比横坐标小2；
       {
           if (x % 2 == 0)
           {
               printf("%d\n", ( 2 * x) - 2);
           }
           else
           {
               printf("%d\n",(2 * x) - 3);
           }
       }
       else
       //其他情况；
       {
           printf("No Number\n");
       }
   }
    return 0;
}