Others

This question is very, very difficult. It's notAlgorithmIs the card time. (Very card) This question utilizes the properties of the next array in KMP, that is, the following conclusion: • Conclusion: If Len % (LEN-next [len-1]) = 0, there must

Source: Click to open the link It looks very difficult. I just watched hehe during the competition and didn't think about it. But you can think about it. One coin is placed in each grid on a checker. the front and the back of the coin are 0. Now

Question: Click to open the link Note: 1. Simple simulation. 2. The last multiple output rows. Code: # Include # include # include using namespace STD; int main () {int timeout; while (CIN> timeout) {stack tar; For (INT I = 0; I modify; //

Http://www.codeforces.com/problemset/problem/70/D Two operations 1: Add a vertex to form a new convex hull 2: Determine whether a point is in a convex hull There are two ways to do this, but they are similar, all based on the convex hull

The ACM/ICPC competition is actually a competition for algorithm design and coding. It is necessary to be familiar with and use various common algorithms and algorithm design strategies flexibly. Here we will give a brief introduction to several

Definition of nsange TypedefStruct_ Nsange {  Nsuinteger location;  Nsuinteger length; }Nsange;   Nsange is a struct, where location is an index starting with 0, and length is the length of the object. They are all nsuinteger types. The nsuinteger

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2126 Q: I will give you n kinds of items and the price of each item, m money, and ask you how many different solutions can you buy if you want to buy the most types of items. Solution 1: First, I

I used to use the XIB file to drag controls for the first time. Today I only use code to draw a page. Although it is only a small program, I have been studying it for a day !!! It's just a start! . H file #import @interface RootViewController :

# Import # Import @ Interface uibutton (uibuttonext)-(Void) setbackgroundimage :( uiimage *) image;-(Void) setbackgroundimagebyname :( nsstring *) imagename;@ End# Import "uibuttonext. H"@ Implementation uibutton (uibuttonext)-(Void)

Link: Http://www.spoj.pl/problems/QTREE/ Http://poj.org/problem? Id = 3237 Question: a tree, two update operations, change the edge weight of an edge, reverse all the edge weights of A-> B, and ask the maximum edge weight of a path. These are all

Source: Click to open the link There are two solutions to this question: Tree arrays and line tree. Of course, this is also the general situation of this question. The line tree and the tree are more universal, but the line tree is obviously simpler,

Question link: Click the open link This question was originally intended to use a tree, and later I looked at the type math, so I thought about it in a simple way. The step size is D. If you jump to the right side of a platform or the left side of

Question link: Click the open link In concert with the previous blog: Template question about matrix multiplication. It is required to solve tr (a ^ K) % 9937. Be sure not to wait until the final result is reached. Just a moment after each

Today, I learned a little about matrix multiplication and application, and my line generation is not very good... The definition and solution of matrices have been defined in linear algebra. Here we use less rigorous definitions. A matrix is a

Http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemid = 4472 Picture from: http://blog.csdn.net/woshi250hua/article/details/7824433 The minimum cost of splitting a convex hull into several triangles Solution: The above link has already been

The second time in my life to participate in codeforces, compared to the last time the water was sent, this time it turned into water two hair .. Competition link: Click to open the link The first question is great... However, it is still because

Give you a tree, and then there are m operations. Each operation has two numbers a B, indicating that 1 is added to the edge weight on the simple path from A to B, finally, you need to output the edge weight of each edge. Solution 1: DFS Tree link

Question: Click to open the question link Simulation questions. A total of five questions in one test, with a full score (all made out) of 100, can not do 50, if you do the right 4, and the right time is the first half of all the people who have

250pt .. 550pt: Question: I will give you a special figure in the shape of a cell. Some cells have been occupied. I will ask you to fill the remaining cells with 1*2 bricks as much as possible in the total number of solutions, see. After thinking

Question: Click to open the link Find the duplicate number. The first reaction is map (which they use for hash), which is easy to write (I am a pointer to the weak slag). However, some traps have been found during actual application, leading to