Number Steps
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5538 Accepted Submission(s): 3388
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
Source
Asia 2000, Tehran (Iran)
Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1209 2673 1280 1381 1392
本题看着图分析规律就好:
当x=y时,
- x为偶数,num=2*x;
- x为奇数,num=2*x-1;
当x=y+2时,
- x为偶数,num=2*x-2;
- x为奇数,num=2*x–3;
#include<cstdio>
int main()
{
int n, x,y;
while (scanf("%d",&n)!=EOF)
{
while (n--)
{
scanf("%d%d", &x, &y);
if (x == y)
{
if (x & 1)
printf("%d\n", 2 * x - 1);
else
printf("%d\n", 2 * x);
}
else if (x == y + 2)
{
if (x & 1)
printf("%d\n", 2 * x - 3);
else
printf("%d\n", 2 * x - 2);
}
else
printf("No Number\n");
}
}
return 0;
}