{"trustable":false,"sections":[{"title":"","value":{"format":"PLAIN","content":"xhr知道一头牛的位置,想要抓住它。xhr和牛都于数轴上 ,xhr起始位于点 N(0\u003c\u003dN\u003c\u003d100000) ,牛位于点 K(0\u003c\u003dK\u003c\u003d100000) 。xhr有两种移动方式:\n1、从 X移动到 X-1或X+1 ,每次移动花费一分钟\n2、从 X移动到 2*X ,每次移动花费一分钟\n假设牛没有意识到xhr的行动,站在原地不。最少要花多少时间才能抓住牛?"}},{"title":"Input","value":{"format":"PLAIN","content":" 一行: 以空格分隔的两个字母: N 和 K"}},{"title":"Output","value":{"format":"PLAIN","content":" 一行: xhr抓住牛需要的最少时间,单位分"}},{"title":"Sample Input","value":{"format":"PLAIN","content":"5 17"}},{"title":"Sample Output","value":{"format":"PLAIN","content":"4"}},{"title":"Hint","value":{"format":"PLAIN","content":"xhr使用最短时间抓住牛的方案如下: 5-10-9-18-17, 需要4分钟.\n"}}]}