Others

question: cows like to play house jumping games on the stones in the river, each time they jump from one stone to another. Now we know the starting stone, the ending stone, and the distance from the ending stone to the starting stone. We also know

question: a snail child has been falling down from the top of the tree, but its shell remains on it. So it looks for its shell from the root node (but it completely forgets the path it has traveled ). There may be bugs on some nodes on the road, and

It's not surprising that Michael loves skiing because skiing is really exciting. But in order to get the speed, the slide area must be tilted down, and when you slide to the bottom, you have to go uphill again or wait for the elevator to carry you.

If: /Usr/lib/libpthread. A (pthread_create.o) | in function 'pthread _ create': |(. Text + 0xa2f) | undefined reference to '_ dl_stack_flags' |/Usr/lib/libpthread. A (pthread_create.o) | in function 'pthread _ create': |(. Text + 0xbe5) |

Question: There are n students. A man or a woman may fall into romance. Now I know the romantic relationship of everyone. Find the largest set so that there is no romantic relationship between all people in the set.Question: bipartite graph matching,

When learning OpenGL in Windows, you can use powerful windows APIs. For example, you can use sleep () in the callback function called by gludisplayfunc () to interrupt code execution, you can clearly see the role of each function. By adding sleep ()

1. Install git Sudo apt-Get install git 2. Install rvm Bash 3. Configuration File Search for the two files. If not, create them manually (select one global user) /Etc/rvmrc "$ home/. rvmrc ", The template is in the example directory of the

Document directory Please let us know what is wrong with this page: Strict weak order is a very important concept in STL. We checked a lot of information to figure it out. It seems that we have learned too little in discrete classes. The basic

Author: Zhu JincanSource: http://blog.csdn.net/clever101/   DirectX has a large number of versions and is often confusing. If you want to learn about DirectShow, you are told that DirectShow has been separated from the DirectX 9.0 SDK and you have

# Include #include using namespace STD; # define n 100000 struct node {int val; node * Next ;}; node * POS [N]; /* POS [I] = X indicates that the address of the node where the remainder I appears is x */bool done [N]; /* done [I] indicates that

Calculate the perimeter of the overlapped rectangle.Question: Pay attention to the number of line segments projected on the Y axis when enumerating the X range. That is, it corresponds to the number of discontinuous line segments in X, because the

Enter m dna sequences (strings) with a fixed length of 60 to obtain the longest common subsequences of m dna. If there are several Longest Common subsequences, the smallest Lexicographic Order is output.It is obviously a string matching problem. KMP

Question: Reading is disgusting ···. That is to say, there are now n Different jacks, m different appliances, and K adapters. (The adapter is equivalent to an intermediate socket, for example, an adapter is (x, y ). There is an electrical appliance

F indicates the number of farms, N indicates the number of regions in each farm, M indicates the number of edges connecting any two regions, and W indicates the number of wormhole holes. John enjoys time travel. There are many areas on his farm, and

Some schools are connected over the Internet. Each school has a list, that is, the points it points. The list of school A contains school B, and it cannot be guaranteed that the list of school B contains school. There is a software. 1. Ask at least

Given a string, for example, STR: ababab, STR = AB ^ 3 and output 3. For example, ABCD, output 1.Question: understand and remember the application of the next function. # Include using namespace STD; # define n 1000005 char STR [N]; int next [N], n;

Farmer John's cattle farm is a rectangle in Column C of column R. After heavy rain, water is accumulated in the low-lying areas of the cattle farm. John's cows are very delicate. When they eat grass, they don't want to dirty their hooves. To prevent

FJ takes his friends to visit the farm. Their starting point is 1 and the ending point is N. There may be paths between points. It is now required to take the shortest path from 1 to n and return from N to 1. In addition, the road that has been

Q: use k different colors to dye a n-length necklace. Question: 1. Rotation replacement: There are n rotation replacements, which are rotated in sequence: 0, 1, 2, ''' n-1. For each rotation replacement, the number of cyclic factors obtained after

The total price is cash now. There is a currency with a version value. The number of each coin is amount and the nominal value is denomination, the maximum value sum that can be composed of less than or equal to the total price.Question: multiply