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
bhushangawde: 2016-05-12 08:58:16

AC in first attempt!! oh yeah!! was fun :) just the logic... thats it !!

bhushangawde: 2016-05-12 08:39:20

nyc 1

chakkriii: 2016-05-11 15:25:04

find the logic, nothing to code :)

gautam: 2016-04-05 20:46:14

too easy...;-)

i_love_coding: 2016-03-12 11:41:35

Silly mistake cost me 2 WA's ...remember solution at i=0,j=0

takedonick: 2016-03-05 03:20:22

Finally accepted..used c++ this time around

Last edit: 2016-03-05 03:21:16
lazarus_276: 2016-02-29 23:18:53

finally AC in first go!

try2catch: 2016-02-11 13:28:45

too easy !

suman_biswas95: 2016-02-05 23:14:49

good problem.....

keshavsharma: 2016-01-27 11:02:37

phew... lol finally accepted :D

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