Others

The question is quite tangled... 1... n these people on stage, each person has a wire value D [I], if I number on the K on stage, then his anger value is (k-1) * d [I]. Now there is a stack, You can first put the people in front of the I into the

In the last week, the lab was relocated. A lot of people seem a little fresh and even a little excited. Today, I went to the top to clean up and suddenly felt like this was not a new home, and it was more like an escape! After turning over the

Very bare generation function: My code: #include #include #include using namespace std;const int N = 100;int c1[N], c2[N];int val[N];int main() {//freopen("data.in", "r", stdin);int i, j, k, t, ans;while(~scanf("%d", &t)) {while(t--) {for(i = 1; i

Http://acm.whu.edu.cn/land/problem/detail? Problem_id = 1338 N different coins, each with num [I. How many methods are there to place these coins in one line.  Solution: Set a total of sum coins, regardless of the same coin situation. Combine the

The Collatz Sequence An algorithm given by Lothar Collatz produces sequences of integers, and is described as follows: Step 1: Choose an arbitrary positive integer AAs the first item in the sequence. Step 2:

Tarjan: It's so cheap, wa more than 10 times... Idea: Use "" to perform forced connection and contraction. Then, count the number of points with 0 inbound and the number of points with 0 outbound In the scaled-down graph. A is in, B is max (In, out )

The maximum flow of minimum fees learned here. Definition: Graph G uses s as the Source Vertex and T as the sink vertex. C (I, j) is the capacity of G, F (I, j) is the capacity of G, w (I, j) is the unit traffic fee and w (I, j) =-W (J, I ). Cost WF

The rapid power of the matrix. The modulo of the outermost layer is 1e9 + 7, the modulo L1 = Of the second layer (the cyclic section of 1e9 + 7), and the modulo of the third layer is L2 = (the cyclic section of L1) Brute force L2 and L1 are detected,

/* God... Completed the entire night. Simple dyeing problem. Scan the problem again after coloring to find the largestContinuous is a white sequence. At first, the 0,109 points must be added. That's because it's all about quick adjustments to shi...

The topic description is scary... The question is to find the strongly connected component, then contract the vertex to get the Dag, and find the contraction point with the outbound degree of 0 in the Dag, and output the set of Shrinkage points

Xie Yong drew a picture and then solved the problem... It is essentially a problem of "semi-plane interaction. Straight cut polygon. The common part is the polygon core. Here we find a good template:Http://blog.csdn.net/accry/article/details/6070621

Hangman judge In ''hangman judge, ''you are writing a program that judges a series of Hangman games. for each game, the answer to the puzzle is given as well as the guesses. rules are the same as the classic game of Hangman, and are

I really didn't think of any good DP Method during the competition... It hurts! The entire game is full of brains ...! DP [I] [J] indicates the person J. I to J indicates the maximum number of people who tell the truth in a group. Num [a] [B]

It is really a good question... I read the problem-solving report for a day and a half to understand the process. What bothers me most is M and N's rank and column problems .... M, N in the text description does not correspond to M, N in the image.

There are many objective reasons, but I don't want to find it. The level is there .... In the future, try to find a quiet environment, such as a lab. I did not answer a question last night. Today, I flipped it back. 300pt: In fact, it is a question

Give the number of mm that each son prefers, and then give a matching sequence to find the mm that each son can bubble, and ensure that each son has a mm bubble. Train of Thought: I think it's a good idea. For example, if my son U prefers MM v, U->

At first glance, it looks like a very obvious mother function. Then I typed out the barabara code, TLE. I'm dizzy. Let's look at it again. The data is big. The triple loop of the primary function will be violent, and think about it carefully. This

Number Sequence Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 40967 accepted submission (s): 8785 Problem descriptiona number sequence is defined as follows: F (1) = 1, F (2) = 1, F (n) = (A *

Five cases, template Reprinted from: http://hi.baidu.com/billdu/item/703ad4e15d819db52f140b0b Give you a simple polygon and a circle with the center at the origin to find the area of the coincidence between the polygon and the circle. That's what it

This question is so tangled... There is no idea about the competition. I can see the question report later. Finally, the written number-like array ran 1.5 s... The idea of the number array is well understood, that is, the control of diagonal lines ..