Others

Number Theory 4.1 divisibility Haha, first article, try to write .... The most familiar concept is GCD, where k/M indicates that K can be used in addition to M.Note that "K can remove M" and "M is a multiple of K" are not exactly the same, for

Http://blog.huang-wei.com/2011/04/27/read-source-tool/   DoProgramStaff, every day to the display lineCodeEspecially when a piece of code you have never written or read is put in front of you, NI will feel as tired as it is.None of these are

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3256 2009 questions about the Ningbo network competition .. This competition is rather difficult ..   For a given 500 line segment, the floating point type can be up to 4 decimal places... Ask how many

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2222 Question: give n strings, and then give an article asking how many of them have appeared in the article... Trick: N strings may be the same and must be processed according to different

Question Match all the characters and their occurrences. Question B Push rules, pay attention to details, such as the midline or something. Question C Good questions. Given n My practices: After the number of input values is sorted in ascending

All 1A, orz ----------. Question D is very small, direct for (I, 1, D ). Question B Pursue the problem. My practice: While (1 ){...} Int front = T * VP at the beginning. Vd * Times = front + VP * times; Calculate the times and determine whether

Question The for loop determines whether all the characters starting from 2nd characters are uppercase letters. Note that if the character string contains only one character; Question B -From 10 to 10, you only need to add 10 to each number. Open a

I have to prepare for the interview. I have only recently started to read some previous years of written examination and interview questions. Tonight I will write a summary of the most basic binary search tree traversal. First traverse: First root,

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3887Source:2011 multi-university training contest 5-host by BNU Given a 10 ^ 5 node tree (represented by 1 -- N), we will tell you the root node and find a number smaller than the number below each

Next_permutation () gets the next permutation and combination of the series marked by [first, last. If there is no next permutation and combination, false is returned; otherwise, true is returned. Algorithm process: First, search for two adjacent

  Http://poj.org/problem? Id = 2761   Given an array, find the k Number of some intervals, and the data is 10 times larger than 2104. I didn't start to look at the question, so I directly pasted the code TLE... This topic has a very important

And ak a div2... Question Given a ccppccppcccccpppp string that contains only C and P, the string is left to right and can contain a maximum of five characters each time. The characters must be the same each time and the minimum number of times is

1007 the 36th ACM/ICPC Asia Regional Shanghai site -- online contest 2011acm Shanghai site CompetitionCan you answer these queries?Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4027 For example, if the number is 100000, 0 I j indicates that all

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3068 The question is to find the maximum number of characters in the string... Add a template to the manacher algorithm first .. The code is too short... The suffix array may time out... I found this

I found that the last time is a tree array... Http://poj.org/problem? Id = 3321 Given a tree, its root node is always 1, and each node value is 1 at the beginning. There are two operations: one is to query the total number of nodes under the node,

  Http://blog.huang-wei.com/2010/07/15/double-array-trie%ef%bc%88%e5%8f%8c%e6%95%b0%e7%bb%84%e5%ad%97%e5%85%b8%e6%a0%91%ef%bc%89/     Trie has been widely used in ACM and is also a very effective index structure, so the benefits are not

When gcd (m, n) = 1, we call it M and N. M distinct N is used to represent the mutual elements of the two. M/gcd (m, n) Running N/gcd (m, n) From the relationship between GCD and the prime number sequence, we can conclude that K branch m and K

  Http://blog.huang-wei.com/2010/07/20/%e5%8f%8c%e6%95%b0%e7%bb%84%e5%ad%97%e5%85%b8%e6%a0%91%e7%9a%84%e5%86%85%e5%ad%98%e5%8d%a0%e7%94%a8%e6%b5%8b%e8%af%95/     The previous article introduced the dual array dictionary tree datrie. Now let's simply

    Http://hi.baidu.com/gwwnha/blog/item/2e3718ec4adc45d92f2e2119.html

O (n) echo substring Algorithm Note: I have found that the source code below is a bit of a bug... Corrected it in the next blog ..   Here, I will introduce a method for processing O (n) input strings. Manacher algorithm.Original article address:Http: