{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"农场主约翰已被告知一头逃亡母牛的位置,他想立即抓住她。他从一条数线上的点N(0≤N≤100,000)开始,而cow在同一条数线上的点K(0≤K≤100,000)。农夫约翰有两种交通方式:步行和传送。\n*步行:FJ可以在一分钟内从任何X点移动到X-1或X+1点\n*传送:FJ可以在一分钟内从任意X点移动到2×X点。\n如果这头母牛没有意识到它的追求,根本不动,农夫约翰需要多长时间才能找回它?"}},{"title":"Input","value":{"format":"HTML","content":"第1行:两个空格分隔的整数:N和K(多组输入)"}},{"title":"Output","value":{"format":"HTML","content":"第1行:农场主约翰抓住逃亡的母牛所需的最少时间,以分钟为单位。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e5 17\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e4\n\n\n \u003ci style\u003d\"font-size:1px\"\u003e \u003c/i\u003e\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cpre\u003e农场主约翰到达逃亡奶牛的最快方法是沿着以下路径移动:5-10-9-18-17,需要4分钟。\n \u003c/pre\u003e"}}]}