7位数彩票预测

上次说两要写，一拖就拖到现在。。。拖拉是致命伤

一些前戏可见上一篇文章    xlrd小试牛刀

进入正题

这周开始重读吴军的数学之美，正好看到 Markov Chain，有兴趣的同学可以去买一本瞧瞧

 

#encoding=utf8

#获取十个数中最大的索引
def getmax(Plist):
    max = Plist[0]
    index = 0
    for i in range(len(Plist)):
        if max < Plist[i]:
            max = Plist[i]
            index = i
    return index 


former7ws = [0,3,4,5,2,4,5]  #上次的大奖7位数

p =[([([0]*10) for i in range(10)]) for j in range(7)]   #三维矩阵，存放七位数每一位相邻两数出现的次数

q = [([0]*10) for i in range(10)]

#print p

file = open("/home/yu/workspace/code/python/7ws/7.txt","r")

lines = file.readlines()

l = [([]) for i in range(7)]

#print l

for i in lines:
    for j in range(len(i)-1):            #去掉\n所占的字符
        l[j].append(int(i[j]))

#print l[1]

for i in range(7):
    for j in range(len(l[1])-1):
        row = l[i][j]
        col = l[i][j+1] 
        p[i][row][col] += 1
        q[row][col] += 1
#print len(l[0])
#print p[0]
#for i in range():
#    print p[i]


for i in range(len(former7ws)):
    print getmax(q[former7ws[i]]),getmax(p[i][former7ws[i]])
#    print q[former7ws[i]]

# print former7ws
#for i in range(10):
#    print q[i]

结果在此

特别申明要是中了奖可得分咱点啊！！500万在向你招手有木有！