CN107742209A - A kind of algorithm of the red packet amount of money distribution of simplification - Google Patents
A kind of algorithm of the red packet amount of money distribution of simplification Download PDFInfo
- Publication number
- CN107742209A CN107742209A CN201710926828.3A CN201710926828A CN107742209A CN 107742209 A CN107742209 A CN 107742209A CN 201710926828 A CN201710926828 A CN 201710926828A CN 107742209 A CN107742209 A CN 107742209A
- Authority
- CN
- China
- Prior art keywords
- red packet
- money
- amount
- algorithm
- simplification
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
- G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The present invention relates to the algorithm that a kind of red packet amount of money of simplification distributes, its design overall principle be in a segment limit point open red packet interval time it is shorter, the red packet amount of money that participant is assigned to is more, but make the overall assignment great disparity of the red packet amount of money not excessive again simultaneously, the summation of preceding 1 red packet of N is not more than (N 1) * M0/N, and the amount of money of last red packet is then the difference that total amount subtracts above 1 red packet summation of N.
Description
Technical field
The present invention relates to the algorithm that a kind of red packet amount of money of simplification distributes, and its overall principle designed is in a segment limit
The interval time that point opens red packet is shorter, and the red packet amount of money that participant is assigned to is more, but makes the totality point of the red packet amount of money again simultaneously
Not excessive with great disparity, the summation of preceding N-1 red packet is not more than (N-1) * M0/N, and the amount of money of last red packet is then that total amount subtracts
Go the difference of above N-1 red packet summation.
Background technology
The existing red packet amount of money has quota allocation and is randomly assigned two kinds, the present invention using and click on twice between red packet when
Between difference set the amount of money of red packet, make in certain scope, interval time is shorter twice, then clicks on and open red packet person and obtained
The more method of the amount of money, generally speaking, and a kind of random red packet method of salary distribution, opened due to clicking on twice between red packet
Interval time be substantially random, therefore this method still falls within a kind of method for being randomly assigned red packet.
And get over elder for interval time, then its red packet amount of money being assigned to then can be substantially less, has user's hair so as to work as
When playing red packet, the purpose for encouraging people actively to click on red packet as soon as possible, and the effect of active atmosphere are played.
The content of the invention
The present invention relates to the algorithm that a kind of red packet amount of money of simplification distributes, and its overall principle designed is in a segment limit
The interval time that point opens red packet is shorter, and the red packet amount of money that participant is assigned to is more, but makes the totality point of the red packet amount of money again simultaneously
It is not excessive with great disparity.
The estimated sum to give bonus of setting is N0, and red packet total amount is M0, and as red packet sum N0=1, red packet is always golden
Volume is exactly the amount of money of this red packet.
As red packet number N0=2, in order to prevent that first red packet is always golden more than red packet by the amount of money being calculated first
Volume, the amount of money that the amount of money of first red packet is set to be calculated first is again divided by 3 obtain the amount of money of first red packet, i.e. M1,
Second red packet is that red packet total amount subtracts the difference after the first red packet amount of money.
When red packet sum N is more than or equal to 3, the preceding N-1 amount of money for being clicked red packet are all that this clicks on the time with before
The function of difference T1 to Tn between the one click time, while the summation of preceding N-1 red packet is not more than (N-1) * M0/N.
The amount of money of last red packet is then the difference that total amount subtracts above N-1 red packet summation.
The existing red packet amount of money has quota allocation and is randomly assigned two kinds, the present invention using and click on twice between red packet when
Between difference set the amount of money of red packet, make in certain scope, interval time is shorter twice, then clicks on and open red packet person and obtained
The more method of the amount of money, generally speaking, and a kind of random red packet method of salary distribution, opened due to clicking on twice between red packet
Interval time be substantially random, therefore this method still falls within a kind of method for being randomly assigned red packet.
And get over elder for interval time, then its red packet amount of money being assigned to then can be substantially less, has user's hair so as to work as
When playing red packet, the purpose for encouraging people actively to click on red packet as soon as possible, and the effect of active atmosphere are played.
Participate in the flow chart of the algorithm
User initiates a new red packet first.
The red packet sum of user's setting is N0, and wherein N0 is the natural number more than or equal to 1.
The red packet total amount that user sets is M0.
T0 is set at the time of generating red packet.
It is t1 at the time of getting red packet first.
As N0=1, an only red packet, then M1=M0.
This algorithm terminates.
The interval time for getting red packet first is set to T1, wherein T1=t1-t0.
The rest may be inferred, and the N-1 times interval time for getting red packet is set to T (n-1), T (n-1)=t (n-1)-t (n-2).
The first red packet amount of money is set as M1, the rest may be inferred, and the n-th red packet amount of money is Mn.
Work as T1<At=0.5 second, first red packet amount of money M1=M0/N0* (1+3*T1), M1 maximum in such cases
M1max=2.5*M0/N0, M1 minimum M 1min=M0/N0.
Work as 0.5s<T1<During=1s, first red packet amount of money M1=M0/N0* (1+T1), M1 maximum in such cases
M1max=2*M0/N0, M1 minimum M 1min=1.5*M0/N0.
Work as T1>At 1 second, first red packet amount of money M1=M0/N0* (1+1/T1), M1 is most in such cases
Big value M1max=2*M0/N0, M1 minimum M 1min=M0/N0.
To sum up, the maximum of first red packet is 2.5*M0/N0, minimum value M0/N0.
Here, it has been found that a problem, as N0=2, it is likely that there is the situation that first red packet value is more than total red packet value,
Therefore additional designs should be carried out to such case.
As N0=2, then the M1/3 of M1=above, M2=M0-M1.
Work as N0>When=3, continue to distribute M2.
Work as T2>When=1, M2=M1/2 (1+1/T2).
Work as T2<When 1, then M2=M1/2 (1+T2).
Work as M1+M2>During 2/M0, then M2=M2/2；On the contrary then M2=M2.
The rest may be inferred
+ the Mn-1 that works as M1+ ...>(n-1)/M0 when, then Mn-1=Mn-1/2；On the contrary then Mn-1=Mn-1.
Mn=M0-Mn-1
Terminate.
Above it is related to numerical scale, suitably can reduces and expand as needed, generally N number of amount of money sum is necessary
Equal to M0.
Brief description of the drawings
The flow chart of Fig. 1 algorithms.
The red packet sum of user's setting is N0, and wherein N0 is the natural number more than or equal to 1.
The red packet total amount that user sets is M0.
T0 is set at the time of generating red packet.
It is t1 at the time of getting red packet first.
As N0=1, an only red packet, then M1=M0.
The interval time for getting red packet first is set to T1, wherein T1=t1-t0.
Embodiment
The present invention relates to the algorithm that a kind of red packet amount of money of simplification distributes, and its overall principle designed is in a segment limit
The interval time that point opens red packet is shorter, and the red packet amount of money that participant is assigned to is more, but makes the totality point of the red packet amount of money again simultaneously
It is not excessive with great disparity.
The estimated sum to give bonus of setting is N0, and red packet total amount is M0, and as red packet sum N0=1, red packet is always golden
Volume is exactly the amount of money of this red packet.
As red packet number N0=2, in order to prevent that first red packet is always golden more than red packet by the amount of money being calculated first
Volume, the amount of money that the amount of money of first red packet is set to be calculated first is again divided by 3 obtain the amount of money of first red packet, i.e. M1,
Second red packet is that red packet total amount subtracts the difference after the first red packet amount of money.
When red packet sum N is more than or equal to 3, the preceding N-1 amount of money for being clicked red packet are all that this clicks on the time with before
The function of difference T1 to Tn between the one click time, while the summation of preceding N-1 red packet is not more than (N-1) * M0/N.
The amount of money of last red packet is then the difference that total amount subtracts above N-1 red packet summation.
The existing red packet amount of money has quota allocation and is randomly assigned two kinds, the present invention using and click on twice between red packet when
Between difference set the amount of money of red packet, make in certain scope, interval time is shorter twice, then clicks on and open red packet person and obtained
The more method of the amount of money, generally speaking, and a kind of random red packet method of salary distribution, opened due to clicking on twice between red packet
Interval time be substantially random, therefore this method still falls within a kind of method for being randomly assigned red packet.
And get over elder for interval time, then its red packet amount of money being assigned to then can be substantially less, has user's hair so as to work as
When playing red packet, the purpose for encouraging people actively to click on red packet as soon as possible, and the effect of active atmosphere are played.
Participate in the flow chart of the algorithm
User initiates a new red packet first.
The red packet sum of user's setting is N0, and wherein N0 is the natural number more than or equal to 1.
The red packet total amount that user sets is M0.
T0 is set at the time of generating red packet.
It is t1 at the time of getting red packet first.
As N0=1, an only red packet, then M1=M0.
This algorithm terminates.
The interval time for getting red packet first is set to T1, wherein T1=t1-t0.
The rest may be inferred, and the N-1 times interval time for getting red packet is set to T (n-1), T (n-1)=t (n-1)-t (n-2).
The first red packet amount of money is set as M1, the rest may be inferred, and the n-th red packet amount of money is Mn.
Work as T1<At=0.5 second, first red packet amount of money M1=M0/N0* (1+3*T1), M1 maximum in such cases
M1max=2.5*M0/N0, M1 minimum M 1min=M0/N0.
Work as 0.5s<T1<During=1s, first red packet amount of money M1=M0/N0* (1+T1), M1 maximum in such cases
M1max=2*M0/N0, M1 minimum M 1min=1.5*M0/N0.
Work as T1>At 1 second, first red packet amount of money M1=M0/N0* (1+1/T1), M1 is most in such cases
Big value M1max=2*M0/N0, M1 minimum M 1min=M0/N0.
To sum up, the maximum of first red packet is 2.5*M0/N0, minimum value M0/N0.
Here, it has been found that a problem, as N0=2, it is likely that there is the situation that first red packet value is more than total red packet value,
Therefore additional designs should be carried out to such case.
As N0=2, then the M1/3 of M1=above, M2=M0-M1.
Work as N0>When=3, continue to distribute M2.
Work as T2>When=1, M2=M1/2 (1+1/T2).
Work as T2<When 1, then M2=M1/2 (1+T2).
Work as M1+M2>During 2/M0, then M2=M2/2；On the contrary then M2=M2.
The rest may be inferred
+ the Mn-1 that works as M1+ ...>(n-1)/M0 when, then Mn-1=Mn-1/2；On the contrary then Mn-1=Mn-1.
Mn=M0-Mn-1
Terminate.
Above it is related to numerical scale, suitably can reduces and expand as needed, generally N number of amount of money sum is necessary
Equal to M0.
Claims (2)
1. the present invention relates to the algorithm that a kind of red packet amount of money of simplification distributes, its overall principle designed is the point in a segment limit
Open that the interval time of red packet is shorter, the red packet amount of money that participant is assigned to is more, but makes the overall assignment of the red packet amount of money again simultaneously
Great disparity is not excessive, and the summation of preceding N-1 red packet is not more than (N-1) * M0/N, and the amount of money of last red packet is then that total amount subtracts
The above difference of N-1 red packet summation.
2. being based on claim 1, above it is related to numerical scale, suitably can reduces and expand as needed, it is generally N number of
Amount of money sum is necessarily equal to M0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710926828.3A CN107742209A (en) | 2017-10-08 | 2017-10-08 | A kind of algorithm of the red packet amount of money distribution of simplification |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710926828.3A CN107742209A (en) | 2017-10-08 | 2017-10-08 | A kind of algorithm of the red packet amount of money distribution of simplification |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107742209A true CN107742209A (en) | 2018-02-27 |
Family
ID=61236670
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710926828.3A Pending CN107742209A (en) | 2017-10-08 | 2017-10-08 | A kind of algorithm of the red packet amount of money distribution of simplification |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107742209A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110493479A (en) * | 2019-08-15 | 2019-11-22 | 咪咕文化科技有限公司 | Implementation method, communication equipment and the realization system of video frequency color ring |
-
2017
- 2017-10-08 CN CN201710926828.3A patent/CN107742209A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110493479A (en) * | 2019-08-15 | 2019-11-22 | 咪咕文化科技有限公司 | Implementation method, communication equipment and the realization system of video frequency color ring |
| CN110493479B (en) * | 2019-08-15 | 2021-08-06 | 咪咕文化科技有限公司 | Method, communication equipment and system for realizing video color ring |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP4340295A3 (en) | Computer implemented method and system for transferring access to a digital asset | |
| US20160148459A1 (en) | Online lottery system for varying probability of winning and method therefor | |
| PH12019500890A1 (en) | Blockchain data protection based on account note model with zero-knowledge proof | |
| WO2002021773A3 (en) | Guaranteed bandwidth sharing in a traffic shaping system | |
| CN108449606B (en) | Barrage limiting method, device, server and medium | |
| EP4120154A3 (en) | System and method for managing event access rights | |
| MX2016010943A (en) | System and methods for facilitating live fantasy sports platform. | |
| CN107742209A (en) | A kind of algorithm of the red packet amount of money distribution of simplification | |
| CN108551585B (en) | Barrage checking method, device, server and medium | |
| CN107622386A (en) | A kind of algorithm of the red packet amount of money distribution of simplification | |
| CN109104356A (en) | Rob management method, system, readable storage medium storing program for executing and the intelligent terminal of red packet | |
| Petrosyan et al. | A time-consistent solution formula for bargaining problem in differential games | |
| Alexander | Application of mathematical models to English secular cycles | |
| Toorawa et al. | Use of simulation to compare the performance of minimization with stratified blocked randomization | |
| TW201525727A (en) | Method and device for processing data in network application and computer-readable storage medium | |
| CN108446125A (en) | Application program installation kit generation method, device, equipment and system | |
| CN107818458A (en) | A kind of network red packet design method | |
| Kalpathy et al. | Survivors in leader election algorithms | |
| CN106506594A (en) | A kind of concurrent computation resource distribution method and device | |
| Smulyanskaya | Factors of fertility ageing rate | |
| CN107705107A (en) | A kind of algorithm for being divided in portion time-out and not getting the red packet amount of money | |
| TW202014953A (en) | Payment collection control method and device, server, and readable storage medium | |
| Olszewski et al. | Bid caps in contests | |
| Singh et al. | Significance of the Correlation in Turn-taking Dialogues | |
| CN107730224A (en) | A kind of network red packet design method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180227 |
|
| WD01 | Invention patent application deemed withdrawn after publication |