{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e \u003cspan\u003e农夫知道一头牛的位置,想要抓住它。农夫和牛都位于数轴上,农夫起始位于点N(0\u0026lt;\u003dN\u0026lt;\u003d100000)\u003cspan\u003e,牛位于点K\u003c/span\u003e(0\u0026lt;\u003dK\u0026lt;\u003d100000)\u003cspan\u003e。农夫有两种移动方式:\u003c/span\u003e\u003c/span\u003e\u003c/p\u003e \n\u003cdiv\u003e \n \u003cspan\u003e1、从X移动到X-1或X\u003c/span\u003e+\n \u003cspan\u003e1,每次移动花费一分钟\u003c/span\u003e\n\u003c/div\u003e \n\u003cdiv\u003e \n \u003cspan\u003e2、从X移动到2\u003c/span\u003e*\n \u003cspan\u003eX,每次移动花费一分钟\u003c/span\u003e\n\u003c/div\u003e \n\u003cdiv\u003e\n \u0026nbsp;\n\u003c/div\u003e \n\u003cdiv\u003e\n 假设牛没有意识到农夫的行动,站在原地不动。农夫最少要花多少时间才能抓住牛?\n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003e \u003cspan\u003e\u003cspan\u003e两个整数,N和K\u003c/span\u003e\u003c/span\u003e\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e \u003cspan\u003e\u003cspan\u003e一个整数,农夫抓到牛所要花费的最小分钟数\u003c/span\u003e\u003c/span\u003e\u003c/p\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e\r\n5 17\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e\r\n4\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cp\u003e The fastest way for Farmer John to reach the fugitive cow is to move along the following path: 5-10-9-18-17, which takes 4 minutes.\u003c/p\u003e"}}]}