Number Steps

最新推荐文章于 2020-02-13 12:24:26 发布

原创最新推荐文章于 2020-02-13 12:24:26 发布 · 334 阅读

0 ·

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

标签

#Number Steps #数学题

简单算法题专栏收录该内容

42 篇文章

订阅专栏

本文介绍了一个基于坐标映射的算法，该算法能够根据输入的坐标(x,y)，返回平面上特定位置对应的非负整数。通过分析坐标与数值之间的对应规律，实现了一种有效的查找方案。输入包括坐标数量及具体的(x,y)坐标对，输出则是每个坐标对应的整数或NoNumber标记。

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
分析：数学问题：
(0,0)------>0,(1,1)------->1
(2,0)------>2,(2,2)------->4
(3,1)------>3,(3,3)------->5
找规律！首先分x=y与y=x-2两种情况，然后再找其中的规律

#include <iostream>
#include <cstdio>
using namespace std;
void print(int a,int b)
{
	if(a==b)
	{
		if(a%2==0)
		printf("%d\n",a*2);
		else
		printf("%d\n",a*2-1);
	}
	else if(b==a-2)
	{
		if(a%2==0)
		printf("%d\n",a*2-2);
		else
		printf("%d\n",a*2-3);
	}
	else
	{
		printf("No Number\n");
	}
}
int main()
{
	int n,a,b;
	scanf("%d",&n);
	while(n--)
	{
	 scanf("%d %d",&a,&b);
	 print(a,b);	
	}
	return 0;
}