Python implementation of red envelope random generation algorithm __ algorithm

</pre><pre name= "code" class= "Python" >#! /usr/bin/python #-*-Coding:utf-8-*-Import Random class Cdispatch:def __init__ (self,sum,count): self.su 
        m = sum Self.count=count #print ' init here sum = ', Sum, ', Count = ', Count def __del__ (self): Pass
        
        #print ' Run Del the class ' Def getlistinfo (self): listinfo=[] Summoney = self.sum*100 For NUM in range (0,self.count): if (num = self.count-1): Listinfo.append ('%0. 2f '%summoney)/100 break bigrand=summoney+1+num-self.count #print ' summoney= ', Summ Oney, ' num= ', num, ' self.count= ', Self.count, ' big= ', bigrand try:a = Random.randint (1,int (Bigrand)
                Except:for i in range (0,num): print ' listinfo[%d] '%i, ' = ', listinfo[i] If num >0:print ' summoney= ', Summoney, ' num= ', num, ' ListinFo[num-1]= ', listinfo[num-1], ' self.count= ', Self.count, ' big= ', Bigrand #print ' a= ', a break Summoney-=a Listinfo.append (float (a)/100) return listinfo to I in range (0,100000 ): dispatch = Cdispatch (1.05,5) Listget = Dispatch.getlistinfo () print Listget del Dispatch