九度oj-1136-Number Steps

原创 2015年11月21日 20:52:14

时间限制:1 秒

内存限制:32 兆

特殊判题:

提交:697

解决:414

题目描述:

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】题目1040:Prime Number 解题报告

【九度OJ】题目1040:Prime Number 解题报告标签(空格分隔): 九度OJ原题地址:http://ac.jobdu.com/problem.php?pid=1040题目描述:Output...

九度OJ 1040 Prime Number (筛素数,试除法)

题目描述: Output the k-th prime number. 输入: k≤10000 输出: The k-th prime number. 样...

九度OJ题目1040:Prime Number

题目1040:Prime Number 时间限制:1 秒 内存限制:32 兆 特殊判题:否 题目描述: Output the k-th prime number. ...
  • zpy2073
  • zpy2073
  • 2017年04月06日 23:39
  • 73

九度OJ 1422 Closest Number

题目链接:http://ac.jobdu.com/problem.php?pid=1422 题目大意是给一个数组,对于每个元素a[i]分别找离a[i]最近且小于a[i]的数,如果左右两边距离相同则取...

九度OJ八皇后问题

  • 2013年04月09日 23:47
  • 3KB
  • 下载

[toj1136]Humble Number

只含有质因数2,3,5,7的数叫Humble Number,输入n,输出第n个H

CF - 805D. Minimum number of steps - 思维+快速幂

1.题目描述: D. Minimum number of steps time limit per test 1 second memory limit per test 256 mega...

Codeforces Round #411(A. Fake NP; B. 3-palindrome; C. Find Amir; D.Minimum number of steps)

A. Fake NP 题解:给定一个闭区间的两个端点,试判断在此区间内所有数字的非1公因子出现最多的数字。如果有多个,给出其中一个就可以了。这道题比较讨巧的方法试直接输出2。 B. 3-pal...

HDU 1391 Number Steps

Number Steps Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) T...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:九度oj-1136-Number Steps
举报原因:
原因补充:

(最多只允许输入30个字)