killer k1

addressFunction fun_email ($ str ){Return (preg_match ('/^ [_\. 0-9a-z-] + @ ([0-9a-z] [0-9a-z-] + \.) + [a-z] {2, 4} $/', $ str ))? True: false;}// Verify the phone numberFunction fun_phone ($ str){Return (preg_match ("/^ (\ d {3} \) | (\ d {3 }\-))? (\ (0 \ d {2, 3} \) | 0 \ d {2, 3 }-)? [1-9] \ d {6, 7} $/", $ str ))? True: false;}// Verify the ZIP codeFunction fun_zip ($ str){Return (preg_match ("/^ [1-9] \ d {5} $/", $ str ))? True: false;}// Verify the urlFunction fun_url ($ str){Return (

; } // Verify the ZIP code Function fun_zip ($ str) { Return (preg_match ("/^ [1-9] \ d {5} $/", $ str ))? True: false; } // Verify the url Function fun_url ($ str) { Return (preg_match ("/^ http: \ // [A-Za-z0-9] + \. [A-Za-z0-9] + [\/= \? % \-_~ '@ [\] \': +!] * ([^ } // The data warehouse receiving escape special character input value can be a string or a one-dimensional array Function data_join ( $ data) { If (get_magic_quotes_gpc () = false) { If (is_array ($ data )) { Foreach ($ data as $

memcached, first download the python-memcached module and execute pip install python-memcached in cmdMemcached is relatively simple, the default only supports simple kv storage, and the cache is written in memory, specifically do not introduceAfter the server opens the service, the simple operation1 #!/usr/bin/env python2 Importmemcache3 4 5MC = Memcache. Client (['172.16.5.7:11211'], debug=True)6Mc.add ('K1','v1')#Add a new kv7Mc.add ('

You can see the ID field at this time the increment is starting at 1000 and has grown to 1002select * from K1;+------+--------+| ID | name |+------+--------+| 1000 | Xiaoke || 1001 | Xiaoke || 1002 | Xiaoke |+------+--------+Take a look at this table statementShow create table K1;+-------+------------------------------------------------------------------------------------------------------ -----------------

AOF (appendoffile) Introduction: Record each write in the form of a log, record all the write commands performed by Redis (read operation not recorded), only append files but not overwrite files, Redis startup early read the file to reconstruct the data, in other words, When Redis restarts, the write instruction is executed from front to back based on the contents of the log file to complete the recovery of the data. That is to say, AOF will all the write operations in the form of a daily log

[Dllhost.exe] Process file: DLLHOST or dllhost.exe Process name: dcom dll host process Description: The dcom dll host process supports DLL running Windows programs based on COM objects. Introduction: COM proxy. The more DLL components attached to the system, the more CPU resources and memory resources the DLLHOST occupies, in August, the "Shock Wave killer" probably made everyone familiar with it. Resolving the dllhost.exe error of the webserver An e

original value is replaced with the new value. Test code: [Java]Package test. junit;Import java. util. HashMap;Import junit. framework. TestCase;/*** In HashMap, determine whether two keys are the same: first judge the hashCode and determine whether equals* E. hash = hash (k = e. key) = key | key. equals (k ))* @ Author xuefeng**/Public class HashMapTest extends TestCase {/*** The hashCode of v1 and v4 is the same, but the equals does not match. Therefore, v1 and v4 form a linked list.*/Publi

T1:"Data Range"40% of the data meet a;another 30% of the data meet n,m;| s|,| T|100% of data meet n,m;| s|,| t|. The number of occurrences of the match in the Loop section, that is, the LCM (S,t), is first obtained.Then multiply the number of loops.is the number of equal character logarithm of the position of D=GCD (s,t) in the s,t.Can prove.Prove:Set S length to l1,t length of L2If the character of position A in S is the same as the character of position B in T.If it can be matched within the l

($ data );}}Return $ data;}// Data warehouse restore special character input value can be a string or one/two-dimensional arrayFunction data_revert ( $ data){If (is_array ($ data )){Foreach ($ data as $ k1 => $ v1){If (is_array ($ v1 )){Foreach ($ v1 as $ k2 => $ v2){$ Data [$ k1] [$ k2] = stripslashes ($ v2 );}}Else{$ Data [$ k1] = stripslashes ($ v1 );}}}Else{

lists are combined into an ordered dictionary2 #dic = {' K1 ': ' v1 ', ' K2 ': ' V2 '}3 #li = List ([' K1 ', ' K2 '])4 #5 #For I in Li:6 #print (Dic[i])7 ImportCollections8 9DIC =collections. Ordereddict ()Tendic['K1'] ='v1' Onedic['K2'] ='v2' Adic['K3'] ='v3' - Print(DIC)#ordereddict ([' K1 ', ' v1 '), (' K2 ', ' V2

, according to the requirements of each functionTu = (' Alex ', ' Eric ', ' Rain ')a. 计算元组长度并输出tu = (‘alex‘, ‘eric‘, ‘rain‘)print(len(tu))b. 获取元组的第 2 个元素，并输出tu = (‘alex‘, ‘eric‘, ‘rain‘)print(tu[1])c. 获取元组的第 1--‐2 个元素，并输出tu = (‘alex‘,‘eric‘,‘rain‘)print(tu[0:2])d. 请使用 for 输出元组的元素tu = (‘alex‘,‘eric‘,‘rain‘)for i in tu : print(i)e. 请使用 for、len、range 输出元组的索引tu = (‘alex‘,‘eric‘,‘rain‘)for i in range(len(tu)) : print(i)f. 请使用 enumrate 输出元祖元素和序号（序号从 10 开始）tu = (‘alex‘, ‘eric‘,

#include #include#include#include#includeusing namespaceStd;typedefLong LongLL;Const intN = -+2;Const intMoD =998244353;intt,n,m,lim,q,tot,w[n],dp[n][n][n][3],head[n];structedge{intV,next;} Edge[n*n/2];voidAddintUintv) {EDGE[TOT].V=v; Edge[tot].next=Head[u]; Head[u]=tot++;} InlinevoidUpintx,inty) {x+=y;if(X>=mod) x-=MoD;}BOOLJudgeintIintj) { returnABS (W[i]-w[j]) Lim;}intMain () {scanf ("%d",T); while(t--) {scanf ("%d%d%d%d",n,m,lim,q); for(intI=1; i"%d",W[i]); memset (Head,-1,sizeof(head)),

(intXintchain) { intk=0; SZ++; POS[X]=sz;//assigning the number of X nodes in the segment treebelong[x]=chain; for(intI=HEAD[X]; I I=e[i].next)if(deep[e[i].to]>deep[x]size[e[i].to]>Size[k]) k=e[i].to;//Select subtree Max son inherit heavy chain if(k==0)return; DFS2 (K,chain); for(intI=HEAD[X]; I I=e[i].next)if(deep[e[i].to]>deep[x]k!=e[i].to) DFS2 (e[i].to,e[i].to);//The rest of the sons new open heavy chain}intLcaintXintY//Seeking LCA{ if(deep[x]Deep[y]) swap (x, y); intt=deep[x]

Advanced Data StructuresOne, left bias tree oblique heapMerge, INSERT, deleteHit MarkstructNode {intFA,L,R,W,DEP} TREE[MX];intMerge (intK1,intK2)//The return value is the root node{ if(k1==0|| k2==0)returnk1+K2; if(k1.valk2.val) Swap (K1,K2); TREE[K1].R=Merge (TREE[K1].R

straight line and used as the other two sides of the rectangle. 5. traverse all adjacent two points of the convex hull and run the new two ~ 4. Use the rectangle with the smallest area as the result. Normally, the rectangle goes through five random points. The result is as follows: The Matlab code is as follows: Clear all; close all; clc; n = 30; P = rand (n, 2); ind = convhull (P (:, 1), P (:, 2 )); L = length (IND); hull = P (IND, :); % random dot Convex Hull area = inf; for I = 2: l p1 = hu

]) print (obj) ########## Result:counter ({22:2, 33:1, 11:1}) Counter ({22:3, 11:2, 33:1, 44:1}) Counter ({22:2, 33:1, 11:1, 44:0})Second, ordered dictionary (ordereddict)An ordered dictionary (ordereddict) is a subclass of a dictionary that records the order in which elements are added, based on a dictionary#导入collections模块import Collectionsdic = collections. Ordereddict () dic[' k1 '] = ' v1 ' dic[' k2 '] = ' v2 ' dic[' K3 '] = ' v3 ' Print (DIC) ##

1.hash type OperationImport Redispool = Redis. ConnectionPool (host= "192.168.48.131", port=6379, db=0) R = Redis. Redis (Connection_pool=pool)#hash类型操作: is a name corresponding to a dictionary#语法 Hset (name, key, value)A key-value pair is set #name the corresponding hash (does not exist, the key-value pair is created; otherwise, the key-value pair is modified)# syntax parameter explanation:Name:redis's hash nameKey:key1 corresponding to the key in the hashValue:value1 value in the corresponding

precedence over RBD file load.8.Redis of transactions1) APIOpen things MultiCancel transaction: DiscardThe monitoring is canceled regardless of failure or success after submitting the thing EXEC//commitMonitoring: WatchUn-monitoring: unwatch//Cancel all monitoring2) RollbackAfter you open the transaction before the exec error, then all rollback, if the error after the exec, then the error-prone statement continues execution, does not rollback127.0.0.1:6379> multiok127.0.0.1:6379> set

1. For numbers and strings, assignments, shallow copies, and deep copies are meaningless because they always point to the same memory address. >>> Import Copy# ######### number, string #########>>> N1 = 123>>> Print (ID (N1))# # # Assignment # #>>> N2 = N1>>> Print (ID (n2))# # # Light Copy # #>>> N2 = copy.copy (n1)>>> Print (ID (n2))# # # Deep Copy # #>>> n3 = copy.deepcopy (N1)>>> Print (ID (n3))2. For dictionaries, Ganso, and lists, the changes in the memory address of the assignment, the sh

Code Source: "Graph theory algorithm and its realization of MATLAB" (Beijing Air and Space Press)P25First, the function N2shorf is used to calculate the shortest path length between any two points and the least-shorted nodeNeed to enter start point, end point1function [P u] =N2shorf (W,K1,K2)2 3%W represents the weight matrix4%K1 represents the starting point, and K2 represents the endpoint5%p represents th