


PHP lottery algorithm program code for winning probability_PHP tutorial
Based on these needs in the initial stage, and then based on the information on the Internet, a staged extraction method was adopted. Let’s take a look at the overall program: This program is completed under the ThinkPHP framework, using some frameworks to automatically I will explain the class libraries and functions provided one by one below, the controller part
The requirements that the lottery algorithm needs to meet are as follows:
1. You can control the probability of winning
2. Randomness
3. It is best to control the number of prizes
4. Limit the number of draws based on user ID or IP, mobile phone number, QQ number and other conditions
Based on these needs in the early stage, and then based on the information on the Internet, a staged extraction method was adopted. Let’s take a look at the overall procedure:
This program is completed under the ThinkPHP framework, using some class libraries and functions that come with the framework. I will explain them one by one below. The controller part:
The code is as follows | |
/** * * * @lanfengye */ class ChoujiangAction extends Action { //The start time of the lottery var $begin_time="2012-12-25 14:00:00"; //Start time 0-no limit //End time of the lottery var $stop_time="0"; //End time 0-no limit //The prize information for this lottery must be filled in in order from largest to smallest. id is the award number, prize is the winning information, v is the probability of winning, and num is the number of prizes //It should be noted that this must also contain information about not winning, and the probability is sorted from small to large var $prize_arr = array( '0' => array('id' => 1, 'prize' => 'Purchase 1G/year space for 44 yuan', 'v' => 1,'num'=>1), '1' => array('id' => 2, 'prize' => 'Purchase 1G/year space for 55 yuan', 'v' => 2, 'num'=>2), '2' => array('id' => 3, 'prize' => 'Purchase 1G/year space for 66 yuan', 'v' => 5,'num'=>2), '3' => array('id' => 4, 'prize' => 'Purchase 1G/year space for 77 yuan', 'v' => 10,'num'=>3), '4' => array('id' => 5, 'prize' => 'Purchase 1G/year space for 88 yuan', 'v' => 15,'num'=>4), '5' => array('id' => 6, 'prize' => 'Purchase 1G/year space for 99 yuan', 'v' => 67,'num'=>10), ); //How to display the home page Public function index(){ //Connect to the database to get the list of winners $Choujiang=M('Choujiang'); $this->assign('list', $Choujiang->where("rid>0")->order('id desc')->select()); unset($Choujiang); //Display the start time of the lottery on the homepage $this->assign('begin_time',$this->begin_time); $this->display(); } /** * Generate winning information, use ajax to request this method, and the customer needs to fill in the QQ number */ Public function make() { $qq_no= trim($_POST['qq_no']); import('ORG.Util.Input'); $qq_no=Input::getVar($qq_no); If(empty($qq_no)){ $this->ajaxReturn(1, 'Please fill in the QQ number correctly!'); exit; } If(!empty($this->begin_time) && time() $this->ajaxReturn(1, 'The lottery has not started yet, the starting time is:'.$this->begin_time); exit; } If(!empty($this->stop_time) && time()>strtotime($this->stop_time)){ $this->ajaxReturn(1, 'This lottery has ended, the end time is:'.$this->stop_time); exit; } //Get the award information array, from private members $prize_arr= $this->prize_arr; foreach ($prize_arr as $key => $val) { $arr[$val['id']] = $val['v']; } //$rid’s winning serial number $rid = $this->get_rand($arr); //Get the award id based on probability $str = $prize_arr[$rid - 1]['prize']; //Winning prize $Choujiang=M('Choujiang'); //Get the number of times a specific QQ number has participated in the lottery from the database. If it is greater than or equal to 3, the number of prompts has been exhausted If($Choujiang->where("qq_no='{$qq_no}'")->count()>=3){ $str='Your 3 lucky draw opportunities have been used up! '; $rid=0; //The number of times to obtain a specific award serial number from the database. If it is greater than or equal to the set maximum number of times, it will prompt that the prize has been drawn. If you need to always win the last commemorative award, just modify this place }elseif ($Choujiang->where("rid={$rid}")->count()>=$prize_arr[$rid-1]['num']) { $str='Sorry, the prize you have drawn has been exhausted! '; $rid=0; } // Generate a user lottery data for recording to the database $data=array( 'rid'=>$rid, 'pop'=>$str, 'qq_no'=>$qq_no, 'input_time'=>time() ); //Write the user lottery information array into the database $Choujiang->add($data); unset($Choujiang); //ajax return information $this->ajaxReturn(1, $str); } /** * Get the winning numbers based on probability */ Private function get_rand($proArr) { $result = ''; //Total probability accuracy of probability array $proSum = array_sum($proArr); //Probability array loop foreach ($proArr as $key => $proCur) { $randNum = mt_rand(1, $proSum); if ($randNum $result = $key; break; } else { $proSum -= $proCur; } } unset($proArr); return $result; } } ?> |
The algorithm is simple to use and has very good concurrent access performance. It can be used in various situations with slight modifications. Combined with user login and other information, it can effectively control the number of draws for each person. By changing the start and end to an array, you can complete the program to draw a lottery at a specific time every day.

TomakePHPapplicationsfaster,followthesesteps:1)UseOpcodeCachinglikeOPcachetostoreprecompiledscriptbytecode.2)MinimizeDatabaseQueriesbyusingquerycachingandefficientindexing.3)LeveragePHP7 Featuresforbettercodeefficiency.4)ImplementCachingStrategiessuc

ToimprovePHPapplicationspeed,followthesesteps:1)EnableopcodecachingwithAPCutoreducescriptexecutiontime.2)ImplementdatabasequerycachingusingPDOtominimizedatabasehits.3)UseHTTP/2tomultiplexrequestsandreduceconnectionoverhead.4)Limitsessionusagebyclosin

Dependency injection (DI) significantly improves the testability of PHP code by explicitly transitive dependencies. 1) DI decoupling classes and specific implementations make testing and maintenance more flexible. 2) Among the three types, the constructor injects explicit expression dependencies to keep the state consistent. 3) Use DI containers to manage complex dependencies to improve code quality and development efficiency.

DatabasequeryoptimizationinPHPinvolvesseveralstrategiestoenhanceperformance.1)Selectonlynecessarycolumnstoreducedatatransfer.2)Useindexingtospeedupdataretrieval.3)Implementquerycachingtostoreresultsoffrequentqueries.4)Utilizepreparedstatementsforeffi

PHPisusedforsendingemailsduetoitsbuilt-inmail()functionandsupportivelibrarieslikePHPMailerandSwiftMailer.1)Usethemail()functionforbasicemails,butithaslimitations.2)EmployPHPMailerforadvancedfeatureslikeHTMLemailsandattachments.3)Improvedeliverability

PHP performance bottlenecks can be solved through the following steps: 1) Use Xdebug or Blackfire for performance analysis to find out the problem; 2) Optimize database queries and use caches, such as APCu; 3) Use efficient functions such as array_filter to optimize array operations; 4) Configure OPcache for bytecode cache; 5) Optimize the front-end, such as reducing HTTP requests and optimizing pictures; 6) Continuously monitor and optimize performance. Through these methods, the performance of PHP applications can be significantly improved.

DependencyInjection(DI)inPHPisadesignpatternthatmanagesandreducesclassdependencies,enhancingcodemodularity,testability,andmaintainability.Itallowspassingdependencieslikedatabaseconnectionstoclassesasparameters,facilitatingeasiertestingandscalability.

CachingimprovesPHPperformancebystoringresultsofcomputationsorqueriesforquickretrieval,reducingserverloadandenhancingresponsetimes.Effectivestrategiesinclude:1)Opcodecaching,whichstorescompiledPHPscriptsinmemorytoskipcompilation;2)DatacachingusingMemc


Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

SecLists
SecLists is the ultimate security tester's companion. It is a collection of various types of lists that are frequently used during security assessments, all in one place. SecLists helps make security testing more efficient and productive by conveniently providing all the lists a security tester might need. List types include usernames, passwords, URLs, fuzzing payloads, sensitive data patterns, web shells, and more. The tester can simply pull this repository onto a new test machine and he will have access to every type of list he needs.

ZendStudio 13.5.1 Mac
Powerful PHP integrated development environment

MantisBT
Mantis is an easy-to-deploy web-based defect tracking tool designed to aid in product defect tracking. It requires PHP, MySQL and a web server. Check out our demo and hosting services.

MinGW - Minimalist GNU for Windows
This project is in the process of being migrated to osdn.net/projects/mingw, you can continue to follow us there. MinGW: A native Windows port of the GNU Compiler Collection (GCC), freely distributable import libraries and header files for building native Windows applications; includes extensions to the MSVC runtime to support C99 functionality. All MinGW software can run on 64-bit Windows platforms.

SublimeText3 Linux new version
SublimeText3 Linux latest version
