문제https://www.acmicpc.net/problem/1697문제 풀이(정답)from collections import dequen, k = map(int, input().split())visited = [0] * 100001def bfs():    q = deque()    q.append(n)    while q:        x = q.popleft()        if x == k:            print(visited[x])            break        for j in (x-1, x+1, 2*x):            if 0 100000 and not visited[j]:                visited[j] = visited[x] + 1          ..