[B1697][숨바꼭질][python]

https://www.acmicpc.net/problem/1697

---

import sys
from collections import deque

limit = 100001

def solve(arr, n, k):
    q = deque()
    q.append(n)

    while q:
        i = q.popleft()

        if i == k:
            return arr[i]

        for j in (i+1, i-1, 2*i):
            if (0 <= j < limit) and arr[j] == 0:
                arr[j] = arr[i] + 1
                q.append(j)

N, K = map(int, sys.stdin.readline().split())
find = [0] * limit

print(solve(find, N, K))