2k eleague

InputMississippiSample Output1185211097463SourceOibh (suffix array)Suffix array: The suffix array sa is a one-dimensional array that holds 1. An arrangement of N sa[1],sa[2],......,sa[n], and guaranteed Suffix (Sa[i]) That is, the n suffixes of s are sorted from small to large, and the first position of the ordered suffix is placed in the SA. Rank array: Rank array rank[i] saved is suffix (i) in all suffixes from small to large row of "rank". The main idea of the multiplication algorithm for su

starting from January 1, 1970. If you are a UNIX programmer, this algorithm may be reasonable for you. But if you're from Windows or the Macintosh camp, you may just have to shake your head and not understand the weird Unix guys. But don't be afraid. PHP provides a very useful function mktime (). You just send it to mktime () The hours, minutes, seconds, months, dates, and years that you want to represent, mktime () returns the total number of seconds since January 1, 1970. Therefore, if you

description of the PHP time setting. PHP is a technology developed on the basis of UNIX, users need to use the number of seconds since January 1, 1970 to represent the current time. It's a bit confusing for the average user who doesn't have any experience with UNIX system programming. But there's no need to worry, because PHP provides us with a very simple solution, the mktime () function. Users can enter the time that the user wishes to represent in the order of hours, minutes, seconds, months

The latest version of the Informix database is 11.5, from Informix 9, Informix 10 to Informix 11.5, in terms of database performance, database management, and application development, and a number of very useful new features are being introduced. The use of these features can greatly improve the database performance, enhance the manageability of the database and the flexibility of application development. We are here to introduce some of these characteristics, I hope to be helpful to you. Some

tree, the number of nodes with a maximum of two forks, the maximum number of leaf nodes (that is, the nodes on each layer to reach the maximum); Complete binary Tree Full binary tree (complete binary trees):A two-prong tree with n nodes is numbered in the sequence, and if the node numbered I (1 DescriptionThe top n nodes numbered from 1 to N in a full two-tree depth of k form a complete binary tree with a depth of K, where 2k-1≦n≦

basis of transformations and can handle a lot of high-end effects, as an advanced application technique. Master the Foundation, can soldiers come to block punches AH.OK, here's how to use the CSS3 transform matrix matrix to achieve the mirroring effect.This is a bit difficult, so we look at the demo first, you can click here: Matrix and mirror symmetry effect demoThe angular value of the rotation is entered in the box (used to determine the symmetric axis of the mirror), and then loses focus, r

punches AH.OK, here's how to use the CSS3 transform matrix matrix to achieve the mirroring effect.This is a bit difficult, so we look at the demo first, you can click here: Matrix and mirror symmetry effect demoThe angular value of the rotation is entered in the box (used to determine the symmetric axis of the mirror), and then loses focus, rendering the corresponding mirror symmetry effect:You can experience matrix the effect of a mirrored gradient on a browser such as Firefox or Chrome.One of

=nlgnProf2: When we are solving recursive expressions, there is also a common method is the mathematical induction method,First, based on the initial values of our recursive expressions and observations, we suspect D (N) =nlgn. When N=1, D (1) = 0, satisfies the initial conditions. For ease of derivation, assume that n is an integer power n=2k of 2, i.e. D (2k) =2klg2k = k*

punches AH.OK, here's how to use the CSS3 transform matrix matrix to achieve the mirroring effect.This is a bit difficult, so we look at the demo first, you can click here: Matrix and mirror symmetry effect demoThe angular value of the rotation is entered in the box (used to determine the symmetric axis of the mirror), and then loses focus, rendering the corresponding mirror symmetry effect:You can experience matrix the effect of a mirrored gradient on a browser such as Firefox or Chrome.One of

above, again it is not an example.Another nice feature of find is the-newer parameter, which allows us to specify a reference file to compare the timestamp, and then find all the files that are newer than the referenced file.650) this.width=650; "src=" Http://s1.51cto.com/wyfs02/M00/80/50/wKioL1c9xv6j85UmAAAeCfAUihw820.png "title=" 13.PNG "alt=" Wkiol1c9xv6j85umaaaecfauihw820.png "/>8. FILE-size-based search-size: Usage is similar to the above$find. -type f-size +

There may be a junior high school to write the last article, the exam AH ~ ~Previously mentioned to some people, coprime hook number a,b,c (ie, a²+b²=c²) are satisfied with a law (in fact coprime satisfied, then not coprime also must meet):When A is odd: b= (a²-1)/2C= (a²+1)/2When a is even: b=a²/4-1C=a²/4+1So, is the condition sufficient (meaning that if the a,b,c satisfies the above-mentioned rule, are these three numbers a coprime?)?Obviously, if coprime is not required, it is absolutely sati

In node, Buffer is a widely used class, and this article will analyze its memory policy from the following levels: The user level, either node Lib/*.js or your own JS file, calls new Buffer Socekt Read/write File Read/write User BufferIn the Lib/buffer.js module, there is a module private variable pool, which points to the current 8K slab:Buffer.poolsize = 8 * 1024x768; var Pool; function Allocpool () { new Slowbuffer (buffer.poolsize); = 0;}Slowbuffer for src/node_buff

Reading comprehensionTime limit:2000/1000 MS (java/others) Memory limit:32768/32768 K (java/others)Total submission (s): 1270 Accepted Submission (s): 512Problem Descriptionread The program below carefully then answer the question.#pragma COMMENT (linker, "/stack:1024000000,1024000000")#include #include #include #include #include #include const int max=100000*2;const int INF=1E9;int main (){int n,m,ans,i;while (scanf ("%d%d", n,m)!=eof){ans=0;for (i=1;i{if (i1) ans= (ans*2+1)%m;else ans=ans*2%m;

[codevs1157]2k Number of binaryQuestion DescriptionSet R is a 2k binary number and meets the following conditions:(1) R is at least a 2-bit 2k binary number.(2) as a 2k binary number, except the last one, each of the R is strictly less than its right adjacent to the next bit.(3) After the R is converted to 2 Q, the tot

directory-type f-newer reference file/Find all files updated with reference file modification time4: search based on file sizeFind directory-type f-size [+2k greater than 2k/ -2k less than 2k/2k equals 2k files]5: Search by direc

aside its development costs or stability, and other excuses, its real purpose is worthy of reflection. We also do not think that Windows 2K and other versions are relatively safe, holding a lucky mind that there is no such weaknesses in the password security system. Our analysis includes Windows 2K and other versions of the "User Login" dialog box, Windows

Topic Description DescriptionSet R is a 2k 2^k number, and the following conditions are true:(1) R is at least a 2-bit 2k 2^k number.(2) as a 2k number, except for the last one, every bit of R is strictly smaller than the one next to its right.(3) when the R is converted to the 2 number Q, the total number of q is no more than W.Here, the positive integers K (1≤k

only advice is to restart. 3. The debug port tells the user that the memory dump image is written to the disk vendor, using a memory dump image to determine the nature of the problem, and also tells the user whether the debug information has been passed to another computer vendor and what port is used to complete the communication. However, the information here does not make any sense to the average user. Sometimes the security section can find out which production team is the problem, and in

-end effects, as an advanced application technique. Master the Foundation, can soldiers come to block punches AH.OK, here's how to use the CSS3 transform matrix matrix to achieve the mirroring effect.This is a bit difficult, so we look at the demo first, you can click here: Matrix and mirror symmetry effect demoThe angular value of the rotation is entered in the box (used to determine the symmetric axis of the mirror), and then loses focus, rendering the corresponding mirror symmetry effect:You

sake of understanding the effect I add, in fact, the axis is invisible when mirroring symmetry.The point around the axis is the center of the transformation in the CSS3 transform , naturally, mirror symmetry is no exception. Because the axis always passes through the origin, it can be represented by arbitrary axes of symmetry y = k * x . The matrix expression is:Matrix ((1-k*k)/(1+k*k), 2k/(1 + k*k), 2k/(1