ZOJ1414
来源:互联网 发布:c语言 new 编辑:程序博客网 时间:2024/06/05 01:16
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 t; int ans; cin>>t; for(int i=0;i<t;i++) { int x,y; int ok=0; cin>>x>>y; if(x==y) { if(x%2==0) ans=x+y; else ans=x+y-1; ok=1; } if(x-y==2) { if(x%2==0) ans=x+y; else ans=x+y-1; ok=1; } if(ok) cout<<ans<<endl; else cout<<"No Number"<<endl; }}
- ZOJ1414
- zoj1414
- zoj1414
- [水]ZOJ1414
- ZOJ1414 Number Steps
- ZOJ1414 Number Steps
- zoj1414 Number Steps
- ZOJ1414题的解法
- ZOJ1414 POJ1663 Number Steps 很简单的找规律题
- ios开发常用的宏,大家一起来收集~
- Mongodb的简单操作方法
- 数据结构与算法 java版 学习笔记 第二章
- MFC 模态对话框的实现原理
- hibernate 多表查询
- ZOJ1414
- oracle,job停了
- hdu(1045)Fire Net(深搜+回朔)
- 找忘记填写性别的员工
- FOJ1559
- Eclipse调试Java的10个技巧
- C++访问MySql数据库
- 两年了——青春!
- c++:eclipse 开发c++环境配置(保你编译成功)