{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"承太郎已经知道了DIO的住所,想要尽快抓住DIO,DIO对此表示毫不在意并一直在他的住所里等着承太郎来找他,我们把世界抽象为一个数轴,承太郎一开始在点N(0 ≤ N ≤ 100,000),DIO会一直在点K(0 ≤ K ≤ 100,000) 等待,承太郎每秒钟有两种操作:\n1.走路:当前在X,下一秒可以在X+1或X-1\n2.用他无敌的白金之星帮助他快速移动:当前在X,下一秒在2*X\n\n现在承太郎想知道,他最早在什么时候才能抓住DIO(到达他所在的位置,DIO是在原地不移动的)"}},{"title":"Input","value":{"format":"MD","content":"一行两个整数N,K"}},{"title":"Output","value":{"format":"MD","content":"一行一个整数,表示承太郎找到DIO的最少时间"}},{"title":"Sample Input","value":{"format":"MD","content":"5 17"}},{"title":"Sample Output","value":{"format":"MD","content":"4"}},{"title":"Hint","value":{"format":"MD","content":"按照这个顺序,5-10-9-18-17,花费4秒"}}]}