C++

The project often need to use multi-threading, if a Python program with multi-threading, when the child thread does not end, with CTRL + C is not close the main thread, this time can only kill with kill command, this will be very troublesome.So

struct struct structure body label (optional) {type 1 identifier 1; type 2 identifier 2; ...} (variable definitions are optional);Union Union optional Label {type 1 identifier 1; type 2 identifier 2; .....} optional variable definitions; Unions are

1. Forced conversion; Note that char cannot be forcibly converted to int. If forced conversion is used, the ASCII value of the original integer is obtained.This method is used to remove floating point numbers unconditionally without precision.. 2.

Any program will have some general functional requirements, and the implementation of these requirements constitute a library. It can improve the reusability, robustness and portability of the program, which is also the embodiment of modular design.

Codeforces round #263 (Div. 1) A: greedy, arrange the order, scan from the back to the back, calculate the suffix and, and then scan from left to right to calculate the answer. B: tree-like DP. 0 indicates that if 1 or 1 is absent, 1 or 0 is merged.

1. Automatic attributes The following two statements share the same purpose public int Age { get; set;} 　　 private int Age;public int Age{　　get { return age; }　　set { age = value; }} // The difference between the above two statements is equivalent

Ultraviolet A 1449-Dominating Patterns (AC automatic mechanism) Exercise level: Ultraviolet A 1449-Dominating Patterns There is a string composed of lowercase letters and a text T, which requires that the strings appear in the text most

C ++ implements heap sorting Heap sorting is a sort method that has the advantages of Merge Sorting and insert sorting. Its time complexity is O (nlgn), and it is also an in-situ Sorting Algorithm: at any time, only constant elements in the array

HDU1161 Eddy & #39; s mistakes Eddy's mistakesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission (s): 7588 Accepted Submission (s): 4274 Problem DescriptionEddy usually writes articles, but he likes

HDU 1203 I NEED A OFFER! (01 backpack) Address: HDU 1203 Question .. Simple 01 backpack. Because of habit problems, Every time only one of n and m is judged to be 0, exit .. This time, the system exits only when both of them are 0 .. I used two

UVa10803_Thunder Mountain (Short Circuit) (graph theory) Solution report Bare floyd. #include #include #include #include #define inf 0x3f3f3f3fusing namespace std;int n;double mmap[210][210];struct node { double x,

HDU4746 Mophues (Mobius Inversion)MophuesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 327670/327670 K (Java/Others)Total Submission (s): 647 Accepted Submission (s): 263Problem DescriptionAs we know, any positive integer C (C> = 2) can be

Hdu-4857 escape Topology Sorting   Train of Thought-priority queue + reverse topology + reverse outputIf there are many restrictions on the first pop-up to the array, then pop up unrestricted (with the priority queue by sequence number from large

Codeforces #263 div2 solution report     A. Appleman and Easy Task Resolution:To determine whether each cell is surrounded by an even number of adjacent cells.   Code:   # Include # Include # Include # Include #

POJ 1087 A Plug for UNIX (maximum network Stream)POJ 1087 A Plug for UNIXLink: http://poj.org/problem? Id = 1087Question:There are n (1 ≤ n ≤ 100) sockets, each of which is described using a alphanumeric string (up to 24 characters ). There are m (1

HDU1097 A hard puzzle A hard puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission (s): 29415 Accepted Submission (s): 10581 Problem Descriptionlcy gives a hard puzzle to feng5166, lwg, JGShining

An example of C ++ inheritance, virtual functions, and polymorphism code # Include # Include Using namespace std; namespace Animals {class Dog {private: string name; public: Dog (string name): name (name) {} Dog (): name (NULL) {}

Hash of the poj 3690 Constellations Matrix Given an n * m matrix and t p * q matrix, evaluate the number of sub-matrices of this t matrix that are n * m. All matrices are 01 matrices, only '0 ''*' Hash of the matrix. hash the q columns in each row

Ultraviolet A 1492-Adding New Machine (line segment tree) Link to the question: Ultraviolet A 1492-Adding New Machine In an R? There are N old machines in the C matrix. Given the land occupation of each machine, now we need to add 1? M machine, ask

Priority of C ++ common functions, template functions, and special function OverloadingIn the face of the C ++ template, you need to pay attention to it because of the complexity of the template, there are many situations, so it is best to learn the