动态规划【跳石板】python

在这里插入代码片
N,M = [int(x) for x in input().split()]
steps = [i for i in range(N,M+1)] #储存由N到M之间的石板
commondivisors = [] #储存由N到M之间每一块石板允许跳的步数
for i in steps:
    commondivisori = [x for x in range(2,i) if i/x%1==0]#对于石板i允许跳的步数，需要删除1和i本身
    commondivisors.append(commondivisori)
dp = [i-N for i in range(N,M+1)] #初始dp中石板N跳跃到石板i的步数都令为i-N
for i in range(N,M+1):
    for x in range(N,i):
        for j in commondivisors[x-N]:
            if x+j==i and (dp[x-N] != x-N or dp[x-N] == 0):#要求由石板x能跳到石板i，跳跃步数为x的约数j，并且要求石板x也是能够跳跃到的石板或者x石板为初始石板N
                dp[i-N] = min(dp[i-N],dp[x-N]+1) #状态转移方程
for i in range(N+1,M+1):
    if dp[i-N] == i-N: #对于不可跳跃到的石板，令其为-1
        dp[i-N] = -1
print(dp[M-N])