tams schedule

Operation Steps:1, open the Start/program/attachment/System Tools/Task planning, pop-up Task planning window;2, and then double-click "Add Task Schedule";3, run the Task Planning Wizard, click "Browse";4, find the system disk under the Windows/system32 directory of Shutdown.exe files, click the "Open" button;5. Type the name of the task (such as "Reboot") in the dialog box that appears, and choose "Weekly" as the method of execution.6, then press "Nex

mysql| Server | data | The database should consider establishing a schedule of preventative maintenance to help detect problems so that you can take steps to fix them: 1 perform regular database backups and allow updates to the log. 2 Arrange regular routine table inspection. By checking the table, you will reduce the chances of using backups. This job uses a cron job (typically called from the crontab file in the account that the server is running) a

Linux full-schedule task for MySQL _shell small script for MySQL with smaller data size.#!/bin/bashPort= ' 5001 'User= ' admin 'Passwd= ' admin 'Socked= "/data/socket/mysql${port}.sock"backup_file= ' /data/mysql/backup ' #注意磁盘空间情况backup_save_days= ' 2 '#删除N天之前的Cmd1= ' show databases; 'Time= ' Date +%y%m%d_%h%m%s 'Every_day_backup_dir= "${backup_file}/${time}_backup"Db_list= "${every_day_backup_dir}/db_list.txt" #数据库名字存放文件# function:check_db ===> Db_li

) DEFAULT NULL, `version_name` varchar(45) DEFAULT ‘‘ , `v` varchar(10) DEFAULT ‘‘, PRIMARY KEY (`id`), UNIQUE KEY `id_UNIQUE` (`id`)) ENGINE=InnoDB AUTO_INCREMENT=1161854 DEFAULT CHARSET=utf8mb4 ROW_FORMAT=DYNAMIC;");PREPARE stmt FROM @sqlstr;EXECUTE stmt;END;Then create the event 1st each month to execute the above stored procedure:DELIMITER $$SET GLOBAL event_scheduler = 1;CREATE EVENT event_create_table_every_monthON SCHEDULE EVERY 1 MONTHSTAR

[Content of this section] The timer is indispensable in most games, that is, the corresponding refresh body function should be executed at intervals to update the screen, time, progress, and enemy commands of the game. Cocos2dx provides related operations for timer schedule. The operation functions are defined in ccnode. Therefore, most engine classes can Set timers, such as cclayer, ccsprite, and ccmenu. There are three types of timer update Methods

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

=getchar ()) x=Ten*x+ch-'0';returnsig?x:-x; + } -InlinevoidWriteintx) { the if(x==0) {Putchar ('0');return;}if(x0) Putchar ('-'), x=-x; * intlen=0;Static intbuf[ -]; while(x) buf[len++]=x%Ten, x/=Ten; $ for(inti=len-1; i>=0; i--) Putchar (buf[i]+'0');return;Panax Notoginseng } - intMain () { the while(true){ +N=read ();if(!n) Break; AMSE (fch,null); ms=adj; theM=read (); K=read ();intx, y; +Rep (I,1, K) { -Read (); X=read (); Y=read ();if(xy) Add (x, y); $ }write (Hungary ());

selected and the prerequisite matrix is the prerequisite matrix (which has always been considered an adjacency matrix)Therefore, the first step is to give the matrix, to convert the adjacency matrix (also can be adjacent linked list), and then step by step.Code: Public classSolution { Public BooleanCanfinish (intNumcourses,int[] Prerequisites) { int[] Indegree =New int[numcourses]; int[] Matrix =New int[Numcourses] [Numcourses];//[I][j] I is a prerequisite for J I->jstackNewStack(); for

Disk defragmentation is an operation that we often use when we use a computer, defragmenting the disk regularly, allowing our computers to run faster. In the Win7 system, the system defaults to the disk defragmentation plan, and some users do not want to follow the system's default settings to organize, what to do? 　　To set the method: 1. Click "Start"-"All Programs"-"Accessories"-"System Tools"-"Disk Defragmenter" to open the Disk Defragmenter program. 2, click "Configuration Plan", and then

Oracle Database backup: --Keep the backup record of the most recent week; = = = Text: = = Start ============== Echo Set backup file Folder ... Set "Tbuf=e:cwaybackup" echo Sets the backup file name (named after the day of the week, that is, the backup file only saves the last week) ... Set name=%date% Set name=%name:~-3% Set name=orcl_backup_%name% Echo whether there is a file with the same name, delete file if present ... If exist%tbuf%%name%.dmp del%tbuf%%name%.dmp If exist%tbuf%%n

Main topic:There are two machines, each of the two machines have n,m mode, there are k tasks, each task can be completed by a mode of two machines, each switching mode will need to restart the machine, ask at least reboot several times the machine can complete all tasks (start both machines are mode 0)Ideas:Hungary minimum Point coverageBecause there are only two kinds of machines, you can turn each mode into a point, and all points have only two colors, which is a two-part graph.And then the ta

A statistic of 256 programming languages, of course, only a few of these languages are common or practical. 1951–regional Assembly Language 1952–autocode 1954–IPL (The ancestor of the Lisp language) 1955–flow-matic (the ancestor of the COBOL language) 1957–fortran (first compiled language) 1957–comtran (the ancestor of the COBOL language) 1958–lisp 1958–algol 58 1959–fact (the ancestor of the COBOL language) 1959–cobol 1959–rpg 1962–apl 1962–simula 1962–snobol 196