UVALive 2052 Number Steps

最新推荐文章于 2019-03-27 20:50:40 发布

hope1262946533

最新推荐文章于 2019-03-27 20:50:40 发布

阅读量320

点赞数

CC 4.0 BY-SA版权

分类专栏：其他oj

本文链接：https://blog.youkuaiyun.com/liuke19950717/article/details/51991419

其他oj 专栏收录该内容

58 篇文章

订阅专栏

本文介绍了一种在特定平面坐标系中确定整数位置的方法。通过分析坐标规律，实现了一个程序来查找指定坐标上的数字。输入为坐标点(x, y)，输出该点对应的整数或提示未定义。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Number Steps

Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu

Submit Status

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<cstdio>
#include<cstring>
using namespace std;
void slove(int x,int y)
{
	if(x<0||y<0)
	{
		printf("No Number\n");
		return;
	}
	int ans,kase=0;
	if(x==y)
	{
		ans=x+y;
		if(x&1)
		{
			--ans;
		}
	}
	else if(x==y+2)
	{
		ans=x+y;
		if(x&1)
		{
			--ans;
		}
	}
	else
	{
		printf("No Number\n");
		return;
	}
	printf("%d\n",ans);
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		slove(x,y);
	}
	return 0;
}