NSTEPS  Number Steps
Starting from point (0,0) on a plane, we have written all nonnegative 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...10000.
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.
Example
Input: 3 4 2 6 6 3 4 Output: 6 12 No Number
hide comments
akash619j:
20170418 13:55:44
Can be done easily using map of pairs and preprocessing the results beforehand in the map of pairs! 

cipher_097:
20170331 15:48:01
Very easy problems just look out the corner cases. 

xprilion:
20170317 18:13:10
My 2nd (also consecutive) AC in one go! :D 

da_201501181:
20170306 16:09:51
Observation is the key..!! 

bear_grylls:
20170128 13:52:51
what limit of N will be taken in the problem


giriprasad kemburu:
20170127 11:39:28
AC in one go.


themast3r:
20170123 20:57:53
There can be more than one pattern for this. Wasted my time over this. 

ayushagg31:
20170119 16:53:56
#easy problem. Please do check your limits properly. 

phrs_91:
20161223 09:01:31
AC in one go !! do it with pen paper and you get it!!! 

harsh2leo:
20161216 18:04:35
Last edit: 20170110 21:22:05 
Added by:  Camilo Andrés Varela León 
Date:  20061125 
Time limit:  1.159s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Asia  Tehran 2000 