python写双色球的开发语言_python写的双色球数据统计程序 －－欢迎改进

#! /usr/bin/env python

# -*- coding: gbk -*-

#awk 'BEGIN{}{if (substr($1,0,1)=="0")

a=substr($1,2);else a=$1;if (substr($2,0,1)=="0")

b=substr($2,2);else b=$2;if (substr($3,0,1)=="0")

c=substr($3,2);else c=$3;if (substr($4,0,1)=="0")

d=substr($4,2);else d=$4;if (substr($5,0,1)=="0")

e=substr($5,2);else e=$5;if (substr($6,0,1)=="0")

f=substr($6,2);else f=$6;if (substr($7,0,1)=="0")

g=substr($7,2);else g=$7; print

"\t"(41-NR)":["a","b","c","d","e","f","g"],";}'

import sys

####functions########

#求和

def thesum(nums):

s=0

cnt=len(nums)

i=0

while i < cnt:

s=s+nums[i]

i=i+1

return s

#区间比

def ratio(nums):

a1,a2,a3=0,0,0

cnt=len(nums)

i=0

while i < cnt:

v=nums[i]

if v in range(1,12):

a1=a1+1

elif v in range(12,23):

a2=a2+1

else:

a3=a3+1

i=i+1

return str(a1)+":"+str(a2)+":"+str(a3)

#012

def ratio012(nums):

a1,a2,a3=0,0,0

cnt=len(nums)

i=0

while i < cnt:

v=nums[i] % 3

if v in [0,3,6,9]:

a1=a1+1

elif v in [1,4,7]:

a2=a2+1

else:

a3=a3+1

i=i+1

return str(a1)+":"+str(a2)+":"+str(a3)

#数据list

def dict2list(dict):

lst=list()

for k, v in dict.iteritems():

lst.append(v)

return lst

#num in datalist frequency

def getredfre(datalist,num):

cnt=len(datalist)

s=0

i=0

while i < cnt:

red = datalist[i][:-1]

j=0

rcnt=len(red)

while j < rcnt:

v=red[j]

if v ==

num:

s=s+1

j=j+1

i=i+1

return s

#blue num in datalist frequency

def getbluefre(datalist,num):

cnt=len(datalist)

s=0

i=0

while i < cnt:

blue = datalist[i][-1:]

if blue[0] == num:

s=s+1

i=i+1

return s

#p,q duplicate

def getdup(datalist,p,q):

cnt=len(datalist)

dup=[]

if p < cnt and q

pl=datalist[p][:-1]

ql=datalist[q][:-1]

#print pl,ql

l=len(pl)

i=0

while i < l:

if pl[i] in

ql:

dup.append(pl[i])

i=i+1

return dup

#最近n期red data set

def latestndata(datalist,last,n):

ndata=[]

i=0

while i < n:

lst=datalist[last-i-1][:-1]

len_lst=len(lst)

j=0

while j < len_lst:

if lst[j] not

in ndata:

ndata.append(lst[j])

j=j+1

i=i+1

ndata.sort()

return ndata

#高度可疑red：不在notinlist1和notinlist2

def highweightred(datalist,notinlist1,notinlist2):

highwr=[]

i=1

while i < 34:

if i not in notinlist1 and i

not in notinlist2:

highwr.append(i)

i=i+1

return

highwr

#2高度可疑red：在inlist，不在notinlist

def highweightred2(datalist,inlist,notinlist):

highwr=[]

i=1

while i < 34:

if i in inlist and i not in

notinlist:

highwr.append(i)

i=i+1

return highwr

#2个list的交集

def thesameelements(list1,list2):

thesame=[]

i=1

while i < 34:

if i in list1 and i in

list2:

thesame.append(i)

i=i+1

return thesame #是否有连续red

def hascontinuered(datalist,last):

n=len(datalist[last-1])

i=1

while i < n:

if datalist[last-1][i] ==

datalist[last-1][i-1]+1:

return

"yes"

i=i+1

return "no"

#奇数偶数比例

def oddevenratio(datalist,last):

n=len(datalist[last-1][:-1])

i=0

odd,even=0,0

while i < n:

if datalist[last-1][i] %

2==0:

even=even+1

else:

odd=odd+1

i=i+1

return

str(odd)+":"+str(even)

#尾

def taildata(datalist,last):

n=len(datalist[last-1][:-1])

i=0

taillist=[]

while i < n:

tail=datalist[last-1][i] %

10

#if tail not in taillist:

taillist.append(tail)

i=i+1

taillist.sort()

return taillist

def datamatrix(datalist,last):

rd=datalist[last-1][:-1]

n=len(rd)

i=1

dm=[]

while i < 34:

if i in rd:

dm.append("xx");

else:

if i<10:

dm.append("0"+str(i));

else:

dm.append(str(i));

i=i+1

print dm[0:6]

print dm[6:12]

print dm[12:18]

print dm[18:24]