SPOJ - 1112. Number Steps 题解

本博客介绍了一个算法,用于解析输入坐标并输出对应坐标点上的数字或提示无数字。程序通过输入测试案例数量及坐标值,实现对点位置数字的准确查找,适用于平面坐标系内的数字排列问题。

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

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.

Illustration



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...10000.

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.

Example

Input:
3
4 2
6 6
3 4

Output:
6
12
No Number

本程序优雅的地方就是充分考虑好各种情况,然后合并起来,代码就简洁了

#include <iostream>
#include <vector>
#include <string>
using namespace std;

void NumberSteps()
{
	int T = 0;
	cin>>T;
	int x = 0, y = 0;
	while (T--)
	{
		cin>>x>>y;
		if (x != y && y+2 != x) cout<<"No Number"<<endl;
		else
		{
			if (x % 2) cout<<x+y-1<<endl;
			else cout<<x+y<<endl;
		}
	}
}

int main()
{
	NumberSteps();	
	return 0;
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值