Delta-wave

最新推荐文章于 2018-08-07 17:24:42 发布

MU__LE

最新推荐文章于 2018-08-07 17:24:42 发布

阅读量357

点赞数

分类专栏： acm

本文链接：https://blog.csdn.net/h326301035/article/details/81156267

版权

acm 专栏收录该内容

115 篇文章 0 订阅

订阅专栏

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

题解：gou'构建一个函数 zb

将数字所在第几行第几个求出来；即（x，y）；

然后将二维坐标（x，y）转化为三维坐标（用一个数组来表示），即可求出最短路线；

代码：

#include <iostream>
#include <cmath>
using namespace std;

void zb(int m,int a[])
{
    int i,x,y;
    for(i=0;;i++)
        if(i*i>=m){
           x=i;
           y=m-(i-1)*(i-1);
           break;
    }
    a[0]=(y-1)/2+1;
    a[1]=(i*i-m)/2+1;
    a[2]=x;
}
int main()
{
    int m,n;
    while(cin>>m>>n){
        int a[3],b[3];
        zb(m,a);
        zb(n,b);
        int sum=0;
        for(int i=0;i<3;i++){
            if(a[i]-b[i]>0) sum+=(a[i]-b[i]);
               else sum-=(a[i]-b[i]);
            }
        /*cout<<a[0]<<ends<<a[1]<<ends<<a[2]<<ends<<endl;
         cout<<b[0]<<ends<<b[1]<<ends<<b[2]<<ends<<endl;*/
         cout<<sum<<endl;
        }
    return 0;
}