# 九度oj-1136-Number Steps

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.

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.

For each point in the input, write the number written at that point or write No Number if there is none.

3
4 2
6 6
3 4

6
12
No Number

2008年北京大学软件所计算机研究生机试真题
#include<iostream>
using namespace std;
int main()
{
int n,x,y,i;
while(cin>>n)
{
for(i=0;i<n;i++)
{
cin>>x>>y;
if(x==y || x-y==2)
{
if(x%2==0)
cout<<x+y<<endl;
else
cout<<x+y-1<<endl;
}
else
cout<<"No Number"<<endl;
}
}
return 0;
}


• 本文已收录于以下专栏：

举报原因： 您举报文章：九度oj-1136-Number Steps 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)