Description
![Download as PDF Download as PDF](https://icpcarchive.ecs.baylor.edu/components/com_onlinejudge/images/button_pdf.png)
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
按图示填写数字,给出一个坐标,问这个坐标上写的数字是多少
比较好找的规律,注意坐标的特点
#include<cstdio>
#include<cstring>
using namespace std;
void slove(int x,int y)
{
if(x<0||y<0)
{
printf("No Number\n");
return;
}
int ans,kase=0;
if(x==y)
{
ans=x+y;
if(x&1)
{
--ans;
}
}
else if(x==y+2)
{
ans=x+y;
if(x&1)
{
--ans;
}
}
else
{
printf("No Number\n");
return;
}
printf("%d\n",ans);
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int x,y;
scanf("%d%d",&x,&y);
slove(x,y);
}
return 0;
}