杭电1030
来源:互联网 发布:网络写手 签约 编辑:程序博客网 时间:2024/05/16 16:07
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
Source
Ural Collegiate Programming Contest 1998
#include<stdio.h>
#include<math.h>
int l[100000],r[100000],level[100000];
void find(int n,int x)
{
int i;
level[x]=1;
for(i=1;;i+=2)
{
if(n-i<=0)
{
l[x]=(n+1)/2;
r[x]=(i-n)/2+1;
break;
}
level[x]++;
n-=i;
}
}
int main()
{
int m,n;
int cnt=1;
while(scanf("%d%d",&m,&n)!=EOF)
{
find(m,cnt);
find(n,cnt+1);
int p=abs(l[cnt]-l[cnt+1])+abs(r[cnt]-r[cnt+1])+abs(level[cnt]-level[cnt+1]);
printf("%d\n",p);
cnt=cnt+2;
}
return 0;
}
- 杭电1030
- 杭电1030
- 杭电1030
- 杭电 1030 Delta-wave
- 杭电 1030 Delta-wave
- 杭电
- 杭电
- 杭电
- acm 杭电 Delta-wave 1030
- 杭电OJ 1030:Delta-wave
- 数学—杭电1030 Delta-wave
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- 深入探索Win32结构化异常处理
- 测试工具
- union中的内存分配
- poj 1161 暴搜(权值都为1的最短路,开会选址)
- ESXi 5.x 命令行操作
- 杭电1030
- Java验证身份证号
- RMAN duplicate之基于备份,具有目标连接
- 第一次开通,这是一篇无关紧要的文章!
- 信用卡提额,需要注意什么?
- 【c++程序】函数指针
- JAVA 调用Web Service的方法
- 笔记1--数据和C
- Git 常用命令速查表