hdu 1030 Delta-wave

Delta-wave

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9491    Accepted Submission(s): 3793

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 

 

 

 

题解：简单的找规律题

 1 #include<stdio.h>
 2 #include<cstring>
 3 #include<stdlib.h>
 4 #include<map>
 5 #include<cmath>
 6 #include<queue>
 7 #include<vector>
 8 #include<iostream>
 9 using namespace std;
10 void find(int n,int &l,int &r,int &level)
11 {
12     int i;
13     level=1;
14     for(i=1;;i+=2)
15     {
16         if(n-i<=0)
17         {
18             l=(n+1)/2;
19             r=(i-n)/2+1;
20             break;
21         }
22         level++;
23         n-=i;
24     }
25 }
26 
27 int main()
28 {
29     int m,n;
30     int ml,mr,nl,nr,mlevel,nlevel;
31     while(scanf("%d%d",&m,&n)!=EOF)
32     {
33         find(m,ml,mr,mlevel);
34         find(n,nl,nr,nlevel);
35         printf("%d\n",abs(ml-nl)+abs(mr-nr)+abs(mlevel-nlevel));
36     }
37     return 0;
38 }

View Code

 

转载于:https://www.cnblogs.com/52why/p/7482980.html