招行模13的题目思路。。没提交，能过测试

s="???5"
s=s[::-1]
dp=[[0 for i in range(13)] for j in range(len(s)+1)]

ti=[1,10,100]
flag=1
dp[0][0]=1
i=1
while i<len(s)+1:
    if s[i-1]=='?':
        for d in range(10):
            ls=(d*ti[i%3-1])%13*flag
            for j in range(13):
                if ls>=j:
                    k=(j+13-ls)%13
                else:
                    k=(j-ls)%13
                dp[i][j]+=dp[i-1][k]
    else:
        ls=(int(s[i-1])*ti[i%3-1])%13*flag
        for j in range(13):
            if ls>=j:
                k=(j+13-ls)%13
            else:
                k=(j-ls)%13
            dp[i][j]=dp[i-1][k]
            
    if i%3==0:
        flag=-flag
    i+=1
        
print (dp[-1][5])