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
AC代码
#include <iostream>
using namespace std;
int main()
{
int n, x, y;
cin >> n;
while(n --)
{
cin >> x >> y;
if(x == 0 && y == 0) cout << 0 << endl;
else if(x != y && x != y + 2) cout << "No Number" << endl;
else if(x % 2 == 0) cout << x + y << endl;
else cout << x + y - 1 << endl;
}
return 0;
}