Delta-wave(HDU 1030)
来源:互联网 发布:vb.net cad批量打印 编辑:程序博客网 时间:2024/06/08 06:05
Delta-wave
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5790 Accepted Submission(s): 2211
Problem Description
A triangle field is numbered with successive integers in the way shown on the picture below.
The traveller needs to go from the cell with number M to the cell with number N. The traveller is able to enter the cell through cell edges only, he can not travel from cell to cell through vertices. The number of edges the traveller passes makes the length of the traveller's route.
Write the program to determine the length of the shortest route connecting cells with numbers N and M.
Input
Input contains two integer numbers M and N in the range from 1 to 1000000000 separated with space(s).
Output
Output should contain the length of the shortest route.
Sample Input
6 12
Sample Output
3
简单数学题,找规律,找到了就发现很水。
从三个角度看这个图,level,left,right,如下图,题目的答案就是3个图上2个点之间的层数的高度差之和。
例如 6 12 ,level=1,left=1,right=1,答案就是3。
例如 3 12 ,level=2,left=1,right=2,答案就是5。
代码:
#include<stdio.h>#include<stdlib.h>void find(int t, int &l, int &r, int &level){level = 1;for(int i=1;;i+=2){if(t-i<=0){l = (t+1)/2;r = (i-t)/2+1;break;}level++;t -= i;}}int main(){int m,n;int ml,mr,nl,nr,mlevel,nlevel;while(scanf("%d %d", &m,&n)!=EOF){find(m, ml, mr, mlevel);find(n, nl, nr, nlevel);printf("%d\n", abs(ml-nl)+abs(mr-nr)+abs(mlevel-nlevel));}return 0;}
- HDU 1030 Delta-wave
- HDU 1030 Delta-wave
- HDU 1030 Delta-wave
- HDU-1030-Delta-wave
- hdu 1030 Delta-wave
- hdu 1030 Delta-wave
- hdu 1030 Delta-Wave+
- HDU 1030 Delta-wave
- Hdu 1030 Delta Wave
- hdu 1030 Delta-wave
- Delta-wave(HDU 1030)
- hdu 1030 Delta-wave
- hdu 1030 Delta-wave
- HDU 1030 Delta-wave
- hdu 1030 Delta-wave
- 【HDU】 1030 Delta-wave
- hdu 1030 Delta-wave
- hdu 1030 Delta-wave
- Android-DirectionalViewPager
- /bin/sed: can't read =xxxx: No such file or directo
- myeclipse 2013 pro创建web Project时,没有web.xml文件
- MSSQL with ties 的理解
- linux上安装logomaker出现浮点数例外
- Delta-wave(HDU 1030)
- dispatch queue 的一些理解
- ucos-ii示例4:邮箱测试
- openfire服务器性能测试的几种方法
- 2014 MVP Open Day 见闻(上)
- 拉格朗日 次梯度法
- CocoaPods 的概述 安装和基本用法
- cocos2d clippindNode,新手引导
- u-boot中分区和内核MTD分区关系