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
Sachin: 2012-10-03 18:42:20

works fine at home but when submiting says wrong answer

Siddharth Shah: 2012-10-03 15:12:32

brute force exceeds the time limit. Have to go by some other way :(

sathyanarayanan: 2012-07-18 16:17:42

use brute force...easy problem :P :)

Last edit: 2012-07-18 16:18:47
Fish3R: 2012-06-28 15:42:42

Just analyse the figure... Easy problem.. :D

sachin tendulkar: 2012-06-27 21:01:21

easy! logic from fig.

marwan akkad: 2012-06-12 15:11:30

I got AC for the first time.
one of the most interesting problem in SPOJ

jorsan: 2012-05-31 02:49:25

i have the same problem of Sarwesh Shah,and i dont understand why, please answer

Last edit: 2012-05-31 02:50:08
Mr.[T]: 2012-05-21 19:38:40

running rite in ideone but WA pls help problem id-7020369

Last edit: 2012-05-21 19:48:39
ananyadiwas: 2012-05-16 18:57:58

for the first attempt got accepted..
one of the easiest program

Archana Anand: 2012-05-12 04:18:32

one of the easiest code in spoj!!

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