NSTEPS - Number Steps

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...10000.



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.



For each point in the input, write the number written at that point or write No Number if there is none.



4 2
6 6
3 4

No Number

hide comments
ayshwarya: 2017-05-07 21:33:25

i thought it stopped at 12 but it should continue..cost me WA

monukumar: 2017-05-04 15:36:21

damn easy !! :)

pandey01: 2017-04-24 13:53:19

AC in One Go!! Just Played with The co-ordinates... game of Even and Odds.

akash619j: 2017-04-18 13:55:44

Can be done easily using map of pairs and preprocessing the results beforehand in the map of pairs!

cipher_097: 2017-03-31 15:48:01

Very easy problems just look out the corner cases.

xprilion: 2017-03-17 18:13:10

My 2nd (also consecutive) AC in one go! :D

da_201501181: 2017-03-06 16:09:51

Observation is the key..!!

bear_grylls: 2017-01-28 13:52:51

what limit of N will be taken in the problem

giriprasad kemburu: 2017-01-27 11:39:28

AC in one go.
#My 23rd.

themast3r: 2017-01-23 20:57:53

There can be more than one pattern for this. Wasted my time over this.

Added by:Camilo Andrés Varela León
Time limit:1.159s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Asia - Tehran 2000