九度oj 1136
来源:互联网 发布:图表数据区域怎么设置 编辑:程序博客网 时间:2024/04/29 11:29
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.
- 样例输入:
34 26 63 4
- 样例输出:
612No Number
- 来源:
2008年北京大学软件所计算机研究生机试真题
#include<iostream>using namespace std;int main(){ int n; while(cin>>n){ int x,y; for(int 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; } }}
- 九度oj 1136
- 【九度OJ】:九度OJ 1050
- 【九度OJ】:九度OJ 1053
- 【九度OJ】:九度OJ 1056
- 【九度OJ】:九度OJ 1059
- 【九度OJ】:九度OJ 1206
- 九度OJ 题目1136:Number Steps
- 九度OJ 题目1136:Number Steps
- 九度oj-1136-Number Steps
- 九度OJ:1000
- 【九度OJ】 1006
- 九度 OJ 1499
- 九度OJ-1002
- 九度OJ-1003
- 九度OJ 1004
- 九度OJ 1003
- 九度oj 采药
- 九度OJ 1001
- 触摸时白色圆圈的中心不在十字架中心的问题
- 【LeetCode】7(4)Search a 2D Matrix(Medium)
- python笔记 4
- hdu 5420 Victor and Proposition 线段树建图+强连通分量
- 裸机开发前准备
- 九度oj 1136
- Ubuntu学习之Linux文件和目录管理
- [LeetCode] Sort Colors(!!两个指针)
- swift详解之九---------------自动引用计数、循环引用(这个必须理解,必须看)
- 分段压缩
- AutoCAD2014打开闪退的解决办法
- var_export 与 var_dump的不同
- SQL Server之存储过程基础知识
- Android MediaScanner