英特尔 2016 软件类研发在线测评 13

intel2016-13.py

def bfs(t: int):
    vis = set()
    q = [1]
    level = 0
    while q:
        for _ in range(len(q)):
            t = q.pop(0)
            if t == 2013:
                return level
            for j in [t + 1, t * 2]:
                if j not in vis:
                    vis.add(j)
                    q.append(j)
        level += 1


print(bfs(1)) # 18