HDU 1391 Number Steps(数学题+找规律)
来源:互联网 发布:linux telnet命令端口 编辑:程序博客网 时间:2024/05/21 10:56
Number Steps
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4960 Accepted Submission(s): 3013
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)
AC代码:
#include<iostream>#include<cstdlib>#include<cstdio>#include<cmath>#include<cstring>#include<string>#include<cstdlib>#include<iomanip>#include<algorithm>#include<time.h>typedef long long LL;using namespace std;int main(){ int x,y,T; scanf("%d",&T); while(T--) { scanf("%d%d",&x,&y); if(x==y) x%2==1? printf("%d\n",x+x-1):printf("%d\n",x+x); else if(x-y==2) x%2==1?printf("%d\n",x+y-1):printf("%d\n",x+y); else printf("No Number\n"); } return 0;return 0;}
1 0
- HDU 1391 Number Steps(数学题+找规律)
- HDU 1391 Number Steps【找规律】
- HDU 1391 Number Steps(思维题目,找规律)
- HDU 4279 Number(数学题,找规律)
- 【POJ】1663 - Number Steps(找规律)
- HDOJ1393 Number Steps(找规律)
- hdu4952 Number Transformation(数学题 | 找规律)
- HDU 1097 1098 数学题 找规律
- 数学题(找规律)-hdu-4371-Minimum palindrome
- hdu 1391Number Steps
- HDU 1391 Number Steps
- hdu 1391 Number Steps
- HDU 1391:Number Steps
- HDU 1391 Number Steps
- hdu 1391 Number Steps
- ZOJ1414 POJ1663 Number Steps 很简单的找规律题
- leetcode -- Number of Digit One -- 数学题,找规律
- 数学题 找规律
- gps数据转换为在百度地图下的坐标
- 并查集简单模板及其解释
- Catalan数2
- maven copy
- 202.Happy Number
- HDU 1391 Number Steps(数学题+找规律)
- JavaMail的java.lang.NoClassDefFoundError: com/sun/mail/util/LineInputStream错误
- iOS tableView 一共0行时候去掉分割线 和 去掉多余分割线
- Swift 中 10 个震惊小伙伴的单行代码
- gerrit安装步骤及控制台输出
- openssl生成公钥私钥对 加解密
- jquery easyui-datagrid 如何清空数据
- iOS开发系列--通知与消息机制
- 18年经验总结:互联网+创业启动不用CTO的秘密!