PKU_ACM1663
来源:互联网 发布:java 业务日志记录 编辑:程序博客网 时间:2024/06/05 07:31
Number StepsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10116 Accepted: 5389Description
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 Input3
4 2
6 6
3 4
Sample Output
6
12
No Number参考代码如下: