ZOJ1414

最新推荐文章于 2017-01-20 06:54:17 发布

原创最新推荐文章于 2017-01-20 06:54:17 发布 · 608 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

ZOJ 同时被 2 个专栏收录

5 篇文章

订阅专栏

简单题

2 篇文章

订阅专栏

本文介绍了一个基于坐标找寻平面中非负整数的程序设计问题。从(0,0)开始，在平面上按特定模式书写所有非负整数。程序读取坐标(x,y)，返回该坐标上的数字。输入坐标范围限定为0到5000，通过分类讨论的方法解决。

Number Steps

Time Limit: 2 Seconds Memory Limit: 65536 KB

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

超水……分类讨论……

#include<iostream>
using namespace std;

int main()
{
    int t;
    int ans;
    cin>>t;
    for(int i=0;i<t;i++)
    {
        int x,y;
        int ok=0;
        cin>>x>>y;
        if(x==y)
        {
            if(x%2==0) ans=x+y;
            else ans=x+y-1;
            ok=1;
        }
        if(x-y==2)
        {
            if(x%2==0) ans=x+y;
            else ans=x+y-1;
            ok=1;
        }
        if(ok) cout<<ans<<endl;
        else cout<<"No Number"<<endl;

    }

}