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
blueranger:
20160601 21:57:03
Be careful... both "N" are capital !!!!!! :P Last edit: 20160601 21:57:46 

mohit_vachhani:
20160525 19:10:10
15th,easy logic Last edit: 20160525 19:10:21 

manish3749:
20160523 10:36:32
verry easy, but be careful while applying the logic, must check for (3,8) (8,3) (7 3) (8,2) (2,8) (8,9) (9,8) (6,8) 

bhushangawde:
20160512 08:58:16
AC in first attempt!! oh yeah!! was fun :) just the logic... thats it !!


bhushangawde:
20160512 08:39:20
nyc 1 

chakkriii:
20160511 15:25:04
find the logic, nothing to code :)


gautam:
20160405 20:46:14
too easy...;) 

i_love_coding:
20160312 11:41:35
Silly mistake cost me 2 WA's ...remember solution at i=0,j=0 

takedonick:
20160305 03:20:22
Finally accepted..used c++ this time around Last edit: 20160305 03:21:16 

lazarus_276:
20160229 23:18:53
finally AC in first go! 
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 JS NODEJS PERL 6 VB.net 
Resource:  Asia  Tehran 2000 