HDU1931_Number Steps【水题】
来源:互联网 发布:工作流设计软件 编辑:程序博客网 时间:2024/05/23 13:06
Number Steps
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4159 Accepted Submission(s): 2513
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
Source
Asia 2000, Tehran (Iran)
题目大意:按照如图所示的规律和顺序给平面描点,给你坐标(x,y),判断(x,y)
上是否有点,若有点,输出该点的值是多少。若没有点,则输出No Number。
思路:可以看做是值为0,1,2,3的点组成的平行四边形的平移,或是递推得到。可看
出0,1,2,3分别平移能得到4个差值为4的等差数列,只需判断点是否在这两条直线上,
然后通过总结出的等差数列的公式计算出该点的值就行了
#include<stdio.h>#include<string.h>int main(){ int T,x,y; scanf("%d",&T); while(T--) { scanf("%d%d",&x,&y); if(x==y && x>=0) { if(x&1) printf("%d\n",2*x-1); else printf("%d\n",2*x); } else if(y==x-2 && x>=2 && y>=0) { if(x&1) printf("%d\n",2*x-3); else printf("%d\n",2*x-2); } else printf("No Number\n"); } return 0;}
0 0
- HDU1931_Number Steps【水题】
- Steps
- Steps
- Steps
- Steps
- Steps
- Steps
- Steps
- steps
- Steps
- steps
- 水题 hdu 1391 Number steps
- 寒假第一天 水题 Steps
- UVALive 2052 Number Steps【简单模拟】水题
- codeforces 805D Minimum number of steps (水题)
- Number Steps
- Number Steps
- Next Steps
- [转载]C++ *max【min】_element函数找最大,小元素
- Android
- BZOJ 1854 SCOI 2010 游戏 二分图最大匹配
- linux下oracle的启动和停止
- 一篇很全面的freemarker教程
- HDU1931_Number Steps【水题】
- Top域名相关介绍
- 生产者和消费者
- 改掉懒、拖延症
- 通过SQL语句修改服务器时间
- 假设栈的输入序列为1、2、3、...、n,求出所有可能的出栈序列
- Jetty和tomcat的三类比较
- Linux备忘录
- Web App开发入门