HDU 1391:Number Steps
来源:互联网 发布:波什程序员 编辑:程序博客网 时间:2024/06/05 11:01
Number Steps
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4727 Accepted Submission(s): 2884
Problem Description
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.
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
34 26 63 4
Sample Output
612No Number
Source
Asia 2000, Tehran (Iran)
Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1106 1040 1209 1029 2673
你 离 开 了 , 我 的 世 界 里 只 剩 下 雨 。 。 。
#include<iostream>using namespace std;int main(){ int n; cin>>n; while(n--) { int a,b; cin>>a>>b; if(a==b||a-b==2) { if(a==b) { if(a&1)cout<<2*a-1<<endl; else cout<<2*a<<endl; } else { if(b&1)cout<<2*a-3<<endl; else cout<<2*a-2<<endl; } } else cout<<"No Number"<<endl; } return 0;}
1 0
- hdu 1391Number Steps
- HDU 1391 Number Steps
- hdu 1391 Number Steps
- HDU 1391:Number Steps
- HDU 1391 Number Steps
- hdu 1391 Number Steps
- 水题 hdu 1391 Number steps
- hdu-oj 1391 Number Steps
- hdu 1391 Number Steps
- HDU 1391 Number Steps【找规律】
- 杭电 HDU ACM 1391 Number Steps
- HDU 1391 Number Steps(数学题+找规律)
- HDU 1391 Number Steps
- Number Steps 1391
- HDOJ 1391 Number Steps
- HDOJ 1391 Number Steps
- HDU 1391 Number Steps(思维题目,找规律)
- hdoj.1391 Number Steps 20140821
- MySQL的ODBC安装错误问题!
- opencv(7)
- git 错误
- 结构体排序
- 从头认识Spring-1.12 注入Map
- HDU 1391:Number Steps
- iOS 技能图谱
- Swift - TableView
- javax.persistence.Query getSingleResult() 的返回内容
- 51Nod 1405 树的距离之和(dp)
- JAVA-GUI基础
- VS2010 下安装 openssl
- Spark PairRDD 转化一
- ZOJ 1414:Number Steps