编程介的小学生
2019-03-31 23:28路程的追击的问题,采用C语言程序的设计的思路怎么来解决的?
Problem Description
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.
- Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute
- Teleporting: FJ can move from any point X to the point 2 × X in a single minute.
If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?
Input
Line 1: Two space-separated integers: N and K
Output
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
Sample Input
5 17
Sample Output
4
- 点赞
- 回答
- 收藏
- 复制链接分享
0条回答
为你推荐
- 为什么下拉列表设置了z-index还是被其他div挡住了?z-index该在哪里设置?设置为多少?
- html5
- javascript
- css
- 2个回答
- 下拉列表展开后被前面的div挡住了,要怎样才能把它移到前面来?
- html5
- javascript
- css
- 1个回答
- 关于一个游戏中拦截算法的简单疑问
- 人工智能
- c++
- 0个回答