|
大小: 981
备注:
|
← 于2008-02-23 15:34:56修订的的版本4 ⇥
大小: 985
备注: converted to 1.6 markup
|
| 删除的内容标记成这样。 | 加入的内容标记成这样。 |
| 行号 10: | 行号 10: |
| attachment:deltawave.JPG | {{attachment:deltawave.JPG}} |
Delta-wave
Time Limit: 1.0 second
Memory Limit: 1 000 KB
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.
1. Input
Input contains two integer numbers M and N in the range from 1 to 1000000000 separated with space(s).
2. Output
Output should contain the length of the shortest route.
3. Sample Input
{{{6 12 }}}