at t next terms

sse4_1 sse4_2 x2apic movbe popcnt TSC _deadline_timer AES Xsave AVX f16c rdrand lahf_lm ABM 3dnowprefetch cpuid_fault EPB invpcid_single PTI Ibrs IBPB STIBP TPR _shadow Vnmi flexpriority ept vpid fsgsbase tsc_adjust bmi1 hle avx2 smep bmi2 erms invpcid RTM mpx rdseed ADX SMAP clflus Hopt intel_pt xsaveopt XsaVEC xgetbv1 xsaves dtherm Ida Arat PLN pts hwp hwp_notify hwp_act_window hwp_eppbugs:cpu_meltdown spectre_v1 spectre_v2 s Pec_store_bypassbogom

Tag: EXEC database ROR RMS Erro scheduled backup local color div1. Create a shell script fileCD usrmkdir DabackupVim backup.shEcho "-----------------------------">>/usr/dbbackup/Dbbackup.logEcho`Date+%y%m%d '"erms Database Backup Start">>/usr/dbbackup/Dbbackup.log/usr/local/mysql/bin/msyqldump-uroot-ppwd erms >>/usr/dbbackup/backup_ 'Date+%y%m%d '. SQLif[$?-eq0]; Then if[-F"/usr/dabackup/backup_ ' Da

integer m, the next m row each line has at least two number I, J, if I=1, you want to output from J is bounced several times after being bounced, if i=2 will also enter a positive integer k, indicating that the coefficient of the J-Elastic device is modified to K. For data n,mOutputFor each i=1, you will output a required number of steps, one row.Sample Input4 1 2 1 1 31 12 1 11 1Sample Output23Chunking1 //2016.8.122#include 3#include 4#include 5#include 6 7 using namespacestd;8 9 Const intN =2

At that time Astar the time to make only 1 questions, after the game (after a long time to fill, lazy really deadly), found that this is the second simpleAnalysis:This problem can be the minimum XOR of each interval andWhen the check is checked, the DP is used to judge, Dp[i][j] represents the first I element into J interval, j is the last element of the last intervalIf DP[I][J] is true, indicates that each interval is longer than L, XOR, or greater than midOtherwise it is falseReturn to Dp[n][m

Given a singly linked list, determine if it is a palindrome.Follow up:Could do it in O (n) time and O (1) space?Idea: The first half of the list is reversed, and the comparison is done.1 classSolution {2 Public:3 BOOLIspalindrome (listnode*head) {4 if(head = = NULL | | head->next = =NULL)5 return true;6 intCount =1;7ListNode Prenode (-1);8Prenode.next =head;9ListNode *cur = head, *nex, *pre = Prenode;Ten while

Http://codeforces.com/contest/506/problem/BProblem a graph also has n points, to M-relations //hello. I ' m Peter.#pragma COMMENT (linker, "/stack:102400000,102400000")#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace STD;typedef Long Longll#define Peter cout#define INPUT Freopen ("Data.txt", "R", stdin)#define Randin srand ((unsigned int) time (NULL))#define INT (0x3f3f3f3f) * *#define

The existing directory is shared between virtual machines and Linux, but each time the program calls the newly created file, it finds no permissions.This specifies that a new file or directory under a specific directory and its subdirectories has read and write permissions for the user Qhfz-r = recursive-m for setting file ACL rulesSetfacl-r-M D:u:qhfz:rwx/data2/resourcecaseSetfacl-r-M D:u: resourcecase:rwx/data2/resourcecase--remove ACL rule using-BSetfacl-r-b/data2/resourcecaseAbove d:u: see b

option already has an ACL, and if your system is mounted without this option, you canMount-o remount,acl/dev/sda1To re-mount. You can also add this mount option to the boot, which is written to the/etc/fatab file.View and settings for ACL permissions (GETFACL, Setfacl)Knowing the meaning of the ACL, but also know whether the system supports ACLs, then the following is how to set/use this ACL?Getfacl: View ACL settings for files/directoriesSetfacl: Setting ACL content for files/directoriesRelate

ACL-related commands, Getfacl (get ACL-related information), SETFACL (set ACL permissions), Chacl (change ACL permissions). Usually used is the second command Setfacl, its specific commonly used parameters are: -M: Set ACL rules for files or directories-M: Read ACL rule from file-x: Removing ACL parameters-X: Read ACL rules from a file and delete them-B: Delete all extended ACL rules, base ACL rules reserved-K: Delete default ACL rules if no default rules are not prompted-R: Recursively set AC

last node is L->next, the L->next next point to the second level of L, and then the L next empty, that is completed the first flip, and then return to P , think of the two nodes as the last one, and then repeat the reverse at the bottom of the third level, and finally complete the reversal. Node*reverselinklist (node*l) { if (l==null) return NULL; if (l->next==null) return L; Node*p=reverselinklist (l->next); l->next->next=l;//th

#include 2#include 3#include 4#include 5#include 6#include 7 using namespacestd;8InlineintGet ()9 {Ten intx =0; One Charc =GetChar (); A while('0'> C | | C >'9') C =GetChar (); - while('0''9') - { thex = (x 3) + (x 1) + C-'0'; -c =GetChar (); - } - returnx; + } - Const intme =1000233; + structShape A { at intL, R, I; - }; - shape C[me]; - intl; - intN, M, CO; - intA[me]; in intS[me]; - intTr[me]; to intNex[me]; + intAns[me]; -InlineBOOLrule (Shape A, shape B) th

Test instructions: You can collect the weights of two disjoint intervals, the interval weights are interval xor, ask these two weights and the maximum is how muchAnalysis: A lot of different or most of the problems are the use of 01 dictionary tree Greedy, do this question when I forgot ... Finally, when you look at someone else's code, I think of this routine.L[i], recording, from 1 to i the largest XOR interval weight,R[i], record, maximum XOR or interval weights from I to nSo the two rounds a

, the number and nRun each group and B sequence KMP calculate the answer#include using namespacestd;#pragmaComment (linker, "/stack:102400000,102400000")#defineLS i#defineRS ls | 1#defineMid ((LL+RR) >>1)#definePII pair#defineMP Make_pairtypedefLong LongLL;Const Long LongINF =1e18;Const DoublePi = ACOs (-1.0);Const intN = 1e6+Ten, M = 1e6, mod = 1e9+7, INF =2e9;intT,n,m,p,s[n],t[n],ans =0; Vectorint>P[n];intNex[n];intMain () {intCAS =1; scanf ("%d",T); while(t--) {scanf ("%d%d%d",n,m,p); for(i

DP[I][J] Indicates the probability of walking the I step to the J node. Initial value dp[0][0] = 1. When you go to a node that is not the end of the word, you can walk past it.!end[i]Last[i] = = Root , this node is only feasible.1#include 2 using namespacestd;3 Const intN =505;4 intIdCharc) {5 if(c >='0'c '9')returnC-'0';6 if(c >='a'c 'Z')returnC-'a'+Ten;7 if(c >='A'c 'Z')returnC-'A'+ $;8 return-1;9 }Ten structtire{ One intnex[n][ +], Fail[n],end[n], last[n]; A introot, L

is listed.-V,--versionPrint the version of Setfacl and exit.-H,--helpPrint help explaining the command line options.--End of command line options. All remaining parameters is interpreted as file names, even if they start with a dash.-If The file name parameter is a single dash, Setfacl reads a list of files from standard input.ACL ENTRIESThe Setfacl utility recognizes the following ACL entry formats (blanks inserted for clarity):[D[efault]:] [u[ser]:]uid [:p

Use Crontab to automatically back up databases under LinuxHere are the steps to perform a simple database backup using the Add and mysqldump of the crontab Timer task, as follows:1. Write a script:/serverback/autobackmysql.shThe contents are as follows:Method One:# #使用mysqldump备份数据库erms/usr/local/mysql/bin/mysqldump-uroot-ppwd erms >>/serverback/mysql_back/erms_$ (date+ "%Y_%m_%d"). sql# #找到/serverback/mysq

},{-1,0},{0,-1},{1,0},{0,1},{-1,0},{0,-1}};int n,m,ax,ay,bx,by,cx,cy,x,y;int min (int a,int b){Return a}int max (int a,int b){Return a>b?a:b;}int BFS (){int num,h,t;Node Fir,nex;FIR.XJ=AX,FIR.XM=BX,FIR.XP=CX;Fir.yj=ay,fir.ym=by,fir.yp=cy;Fir.step=0;Dis[ax][ay][bx][by][cx][cy]=1;queueQ.push (FIR);while (! Q.empty ()){Fir=q.front ();Q.pop ();Map[fir.xj][fir.yj]=1;Map[fir.xm][fir.ym]=1;Map[fir.xp][fir.yp]=1;for (int i=0;i{