[백준] 1697: 숨바꼭질

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

 

from collections import deque
n, k = map(int, input().split())
MAX = 10**5 #1
distance = [0] * (MAX + 1) #2

def bfs():
    q = deque()
    q.append(n)
    while q:
        x = q.popleft()
        if x == k: #3
            print(distance[x])
            break
        for nx in (x-1, x+1, 2*x): #4
            if 0 <= nx <= MAX and distance[nx] == 0: #5
                distance[nx] = distance[x] + 1
                q.append(nx)
bfs()