ZOJ 1414 Number Steps —— C++

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

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

0 ·

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

标签

#ZOJ 1414 Number Steps #C++

ACM 专栏收录该内容

39 篇文章

订阅专栏

本文介绍了一个基于坐标查找对应数值的程序实现方案。该程序能够根据输入的坐标(x,y)，在特定的数值分布平面上找到对应的数值并输出，若坐标位置未分配数值则输出NoNumber。示例输入包括多个坐标点，输出展示了每个坐标对应的数值。

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 n;
	while (cin >> n ) {
		int x, y;
		while (n--) {  //有四种情况
			cin >> x >> y;
			if (x % 2 == 0 && y == x)
				cout << 2 * x << endl;
			else if (x % 2 == 0 && y == x - 2)
				cout << 2 * x - 2 << endl;
			else if (x % 2 != 0 && y == x - 2)
				cout << 2 * (x - 1) - 1 << endl;
			else if (x % 2 != 0 && y == x)
				cout << 2 * (x - 1) + 1 << endl;
			else
				cout << "No Number" << endl;
		}
	}
}