Number Steps
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3928 Accepted Submission(s): 2389
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.
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题目大意:输入坐标,然后判断是否有该坐标的数据(数据如图所示增长),否则输出no number解题思路:根据坐标和数据可以找出规律(看代码)。附代码:#include<stdio.h> int main() { int x,y,N; scanf("%d",&N); while(N--) { scanf("%d%d",&x,&y); if(x==y) x%2?printf("%d\n",x+x-1):printf("%d\n",x+x); else if(x-y==2) x%2?printf("%d\n",x+y-1):printf("%d\n",x+y); else printf("No Number\n"); } return 0; }