Submission #4214

---

Source Code Expand

#!/usr/local/bin/python

BUF = 100

def read():
    return map(int,raw_input().split())


def work((A,B)):
    cost = [-1 for i in range(BUF)]
    Q = []

    cost[A] = 0
    Q.append(A)

    while Q:
        curr = Q[0]
        del Q[0]
        
        if curr==B:
            print cost[B]
        
        dv = [1,5,10,-1,-5,-10]
        for i in range(len(dv)):
            nex = curr+dv[i]
            if 0<=nex<BUF and cost[nex]==-1:
                cost[nex] = cost[curr]+1
                Q.append(nex)    
    

if __name__=="__main__":
    work(read())

Submission Info

Judge Result