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
Shashank Gupta: 2013-11-10 06:34:46

Only 17 lines of C...I was forgetting return 0 so I thought I did something wrong. :P

Arpit Uppal: 2013-08-28 15:44:25

damn easy.. my 50th classical on spoj :)

GAURANGA: 2013-08-11 17:45:35

most easy...remembr y cordinate cannot exceed x cordinate

Amitayush Thakur: 2013-07-26 05:35:44

Time limit should be reduce to 0.05 secs or else this question should be moved to tutorial.Just too easy to do :D

rishi: 2013-06-15 12:33:33

no number should be printed exactly as specified...threw WA at me just for lower case!

Divya Gupta: 2013-03-20 22:24:23

why wa always;

Sivaraman Nagarajan: 2013-02-20 16:41:01

All that is needed is 2 If condition . Took 5 + 5 minutes

Satinjal Yadav: 2013-02-06 14:35:39

easiest problem>>>>>>>>
brute force approach works easily.....

saurabh: 2013-02-03 11:16:42

just see the pattern .........
HInt:-see even and odd number

Narendra yadav: 2013-01-14 18:47:01

sachinmenezes : Print every time in a new line

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