HDU 1391:Number Steps

HDU 1391:Number Steps

Number Steps

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4727    Accepted Submission(s): 2884

Problem Description

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

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.

Sample Input

3 4 2 6 6 3 4

Sample Output

6 12 No Number

Source

​​Asia 2000, Tehran (Iran)​​

Recommend

Ignatius.L   |   We have carefully selected several similar problems for you:   ​​1106​​​  ​​1040​​​  ​​1209​​​  ​​1029​​​  ​​2673​​

你  离  开  了  ，  我  的  世  界  里  只  剩  下  雨  。  。  。

#includeusing namespace std;int main(){ int n; cin>>n; while(n--) { int a,b; cin>>a>>b; if(a==b||a-b==2) { if(a==b) { if(a&1)cout<<2*a-1<

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。