http://poj.org/problem?id=1663
Number Steps
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 12812 | Accepted: 6830 |
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.
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
#include"stdio.h"
int main()
{
int N,x,y;
scanf("%d",&N);
while(N--)
{
scanf("%d%d",&x,&y);
if(x<0 || y<0)
printf("No Number\n");
else if(x==y||x==y+2)
printf("%d\n",x%2? (x+y-1):(x+y) );
else
printf("No Number\n");
}
return 0;
}
本文深入解析了POJ组织的NumberSteps编程竞赛题目,包括平面坐标内非负整数的排列规则,如何通过输入坐标(x,y)来确定该点上所写的数字,以及一种高效的算法实现方式。

被折叠的 条评论
为什么被折叠?



