schedule visualizer

Round robin CalendarI. Problem-DescribingThere are n=2^k athletes, to play a tennis round robin. Now to design a match schedule that meets the following requirements(1). Each player must match one of the other N-1 players(2). Each player can only race once a day(3). Round robin for a total of n-1 daysTwo. Problem analysisAccording to this request, the contest schedule can be designed into a table of N-line

Premise: This method is to use Linux crontab timed tasks to help implement Laravel scheduling (Mac also).First, add crontab scheduled Tasks, here only to do a brief introduction.Add the following with the command crontab-e/usr/local/bin/php /usr/local/var/www/projectName/artisan schedule:run >> /dev/null 2>1 1 2 :The above command crontab every minute to tune the Laravel Schedule command, and then laravel judgment to perform the task

The requirement is to query for a period of time, some of the schedule is repeated each year (month, day), how to get the schedule within a find? The repetition means that the addition of the May 1 schedule of this year, I query next April-May schedule, still can find his I hope I can give you a clue Reply content:

number of files in two files and their total number of rows;8. Write a script(1) Prompt the user to enter a string;(2) Judgment:If the input is quit, exit the script;Otherwise, the string content of its input is displayed;9, write a script, print 2^n table; n equals the value entered by a user; (Sorry, I'm naughty)10, write a script, write a few functions: function 1, to achieve the sum of two numeric values, function 2, take a given two numeric value of greatest common divisor, function 3, ta

* * * Date >> /home/systemdate5.9 Certain two fixed times of a fixed day of the week are executed, for example, Monday and Wednesday of each week 8:00 and 20:00 night 0 8,20 * * * Date >>/home/systemdate 5.10 executed every 30 seconds * * * * * Date >>/home/systemdate * * * * * sleep 30 5.11 First minute of the year @yearly = 0 0 1 1 * 0 0 1 1 * Date >>/home/systemdate 5.12 first minute of each month @monthly = 0 0 1 * *0

Problem Solving Ideas:The above requirements for the minimum point coverage, the minimum point coverage = = Maximum match, to note that the initial mode 0, no consumption, so mode 0 does not need to connect the edge.#include HDU 1150 Machine Schedule (binary graph matching)

http://acm.hdu.edu.cn/showproblem.php?pid=1150Minimum point overwrite = maximum matchTemplate questions1#include 2#include 3#include 4#include string.h>5#include 6 using namespacestd;7 Const intn= the;8 intA[n][n];9 intUse[n];Ten intMatch[n]; One intn,m,k; A - intDfsintu) - { the for(intI=0; i) - { - if(a[u][i]==1!use[i])//determine if contact and match have been made - { +use[i]=1;//tag Matching - if(match[i]==-1|| DFS (Match[i]))//if not matched, match +{/

Test instructions: There are two machines, there are several working areas, there are several tasks, can be completed in one area of two machines, two machines start in 0 areas, each change area, will be restarted once, let us find the minimum number of restarts.Idea: Connect two areas, use a binary map, find the maximum number of matches, easy to understand, just the minimum number of restarts.Note: 01 has been completed at the beginning and should not be added to the matching sequence.The code

The different modes of the machine for the point, for each job, build two side a machine required mode The problem is converted to the minimum point overlay, and then the minimum point of the binary graph is used to overwrite = = maximum match, using the Hungarian algorithm.#include 　　"HDU 1150" machine Schedule (binary graph matching)

Topic Link: PortalThe main topic: There are k tasks, can be done on the X-position of a machine, or on the Y-position of the B machine can be completed. Ask at least how many points you need to complete all tasks.Topic Idea: Ask for the smallest point coverage.The A machine, the B machine as two sets, the task needs to be a bit can be seen as a, a, a minimum point, that is, the least point to cover all the edges.Two-figure matching can be (the minimum point of the two-figure overlay = = Maximum

=" 1.jpg "src=" Http://s3.51cto.com/wyfs02/M02/72/D5/wKioL1XuiFSiEHdlAABFHuQPBEg750.jpg " alt= "Wkiol1xuifsiehdlaabfhuqpbeg750.jpg"/>2, every Sunday 2:30 A.M., run the CP command to backup the/etc/fstab file, the storage location is/BACKUP/FSTAB-YYYY-MM-DD-HH-MM-SS650) this.width=650; "title=" 2.jpg "src=" Http://s3.51cto.com/wyfs02/M00/72/D9/wKiom1XuhkCwzidYAAA5Wrprf-k036.jpg " alt= "Wkiom1xuhkcwzidyaaa5wrprf-k036.jpg"/>3, every night 12 o'clock, get all the lines in the/proc/meminfo file start

files;11. Find all files that are not root, bin or hadoop under the/usr directory;12. Find all files whose contents have been modified and are not root or Hadoop for the last week in/etc directory;13. Find all files on the current system that are not owned by the master or group, and have been visited in the last week;14. Find all files of more than 20k and type of ordinary person in/etc directory;15, look for all the users in/etc directory do not have permission to write files;16. Find at leas