C++

Question:A segment and all segments which are connected with it compose a segment set. the size of a segment set is the number of segments in it. the problem is to find the size of some segment set.   Sample Input110P 1.00 1.00 4.00 2.00P 1.00-2.00 8

Problem:Given two strings s1 and s2, it is required to determine whether s2 can be contained by the string obtained by s1's cyclic shift. Solution:When we perform cyclic shift on s1, we retain the previously removed data, and we will find that if we

This is a typical application of the nearest vertex algorithm. However, this question has multiple restrictions, that is, points are divided into two categories, and the shortest distance must be between different classes. To meet this restriction,

This question uses several knowledge. One is the formula for finding the polygon area. Then, calculate the number of vertices on the boundary of the polygon based on the vertices on the whole point. The last one is pick.Theorem. Calculate the number

I did it with dp. After I finished the work, many people on the internet used the formula. I didn't see it anyway.Dp [I] [j], I indicates that column I is put into a vertical bar, and j indicates the shape of the vertical bar. There are five

In fact, after reading the LCA for several days, I just did not answer the question. Today I found this question. Recently, the public ancestor of the tree wanted to have a good look at graph theory. Fortunately, I bought some books in the team, we

There is a power station s that transmits electricity to t. There are many routes that can be taken. Each road has a loss, and the minimum value of the loss is obtained.Ideas: (1) converting to the shortest-circuit problem, loss = max-max * (1-a %) *

1. Hierarchical DesignCode related to the isolation platform, just like testability, portability also needs to start from the design. Generally, the topBoth the layer and the bottom layer do not have good Portability:1). The top layer is GUI, and

Usage: const_cast (expression) This operator is used to remove the const and volatile attributes of the type. If you see const_cast, you should know that it is used to convert the const nature of the expression. Yes. The const attribute can be

SQLite is not ready for use at a time. Only downloading these things cannot be put into vs2010 and used immediately. The downloaded files include sqlite3.c/h/dll/def, which is not enough. The sqlite3.lib file we need is not in it, and we need to do

StripesTime Limit: 1000 MSMemory Limit: 30000KBTotal Submit: 71 Accepted: 31Description Stripes is a two player game. necessary requisites are a board and rectangular stripes in three colours: red, green and blue. all the red stripes have dimensions

Question: given some trees, each of which has coordinates, heights, and values, it is required to cut down some trees and enclose other trees with those wood, which requires the minimum cost and the same cost, cut down the minimum number of

Toy StorageTime Limit: 2000/1000 ms (Java/Other) Memory Limit: 131072/65536 K (Java/Other) Total Submission (s): 5 Accepted Submission (s): 5 Problem DescriptionMom and dad have a problem: their child, Reza, never puts his toys away when he is

Pick-up sticksTime Limit: 6000/3000 ms (Java/Other) Memory Limit: 131072/65536 K (Java/Other) Total Submission (s): 5 Accepted Submission (s): 5 Problem DescriptionStan has n sticks of various length. he throws them one at a time on the floor in a

The number of points on the tree whose distance is less than or equal to K The n2 algorithm is definitely not good, because points This requires sub-governance. For more information, see the paper of lacquer film. This question is about the division

Given a sequence with a length of n and a constant m, we can divide the sequence into random segments. The weight of each segment is sum (arr [I]). + C (x Solution: After finishing the Hdu 2829, let's look at this question again. Everything becomes

Question:Given A string and A string set A, evaluate the shortest substring length of the string containing all characters in. Solution 1:The most direct method is to directly start traversing: Find whether any two substrings contain str2. If any,

The thread from pthread_craete (), joinable or detached. If it is a jionale thread, you must use pthread_join () to wait for the end of the thread. Otherwise, the resources occupied by the thread will not be released, causing resource leakage. If

The second type of Stirling is the number of methods that divide a set containing n elements into k non-empty subsets.Recurrence formula:S (n, k) = 0 (n S (n, n) = S (n, 1) = 1,S (n, k) = S (n-1, k-1) + kS (n-1, k ). The following figure is taken

This topic uses string Hash to solve the problem. If you think of a string as a P-digit number, you can know that each string can be uniquely represented (P> 256, without considering High Precision ). However, because the length of the string is