POJ 1663：Number Steps

Number Steps

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 13664		Accepted: 7378

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

Sample Output

6

12

No Number

洪水题，找规律。

代码：

#include <iostream>

#include <algorithm>

#include <cmath>

#include <vector>

#include <string>

#include <cstring>

#pragma warning(disable:4996)

using namespace std;

int main()

{

	//freopen("i.txt","r",stdin);

	//freopen("o.txt","w",stdout);

	int Test,x,y;

	cin>>Test;

	while(Test--)

	{

		cin>>x>>y;

		if((x==y||x-2==y)&&x>=0&&y>=0)

		{

			if(x==y)

			{

			    if(x%2)

				{

					cout<<x*2-1<<endl;

				}

				else

				{

					cout<<x*2<<endl;

				}

			}

			else

			{

				if(x%2)

				{

					cout<<x*2-3<<endl;

				}

				else

				{

					cout<<x*2-2<<endl;

				}

			}

		}

		else

		{

			cout<<"No Number"<<endl;

		}

	}

	return 0;

}

巴特西

POJ 1663：Number Steps

最新文章

热门文章