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
把点都存到数组里,输入x,y后,直接找就可以了。
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
. ' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
.............................................
*/
#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define pi 3.1415926
#define INF 123456789
using namespace std;
int main(){
int i, j, x[10000], y[10000], flag, xx, yy, t;
for(i = 0, j = 0, flag = 0; i < 10000; i += 2){
x[i] = j;
x[i + 1] = j + 1;
if(!flag){
flag = 1;
j += 2;
}
else{
flag = 0;
}
}
for(i = 0, j = 0, flag = 1; i < 10000; i += 2){
y[i] = j;
y[i + 1] = j + 1;
if(!flag){
flag = 1;
j += 2;
}
else{
flag = 0;
}
}
scanf("%d", &t);
while(t --){
scanf("%d %d", &xx, &yy);
for(i = 0; i < 10000; i ++){
if(x[i] == xx && y[i] == yy){
cout << i << endl;
break;
}
else if(x[i] > xx && y[i] > yy){
puts("No Number");
break;
}
}
}
return 0;
}