C++

Today, I used some STL functions when I was doing C ++ Primer Chapter 1 exercise 14th, which completely overturned my views on C ++. In the past, I always thought C ++ was very troublesome. To implement a function, I had to write a bunch of code,

Problem:When writing a program, we often find that the program uses more memory than we applied for. In order to optimize the memory usage of the program, we want to optimize the memory usage, but I find that my Code cannot be optimized. What should

I. Example Generally, an automobile engine works in four states: suction, compression, power, and exhaust. During running, different States may have different behaviors. The current state machine will transition to the next state when

TLV is a common structure format for communication. T indicates tag, L indicates length, and V indicates value. T and L are fixed, V is variable, and L represents the length of V. It is usually used for data streams in structured network

There is a global function in sgi stl, destroy, and only one implementation is found for calling a pointer parameter. As follows: That is to say, this function is also called for common types (such as int and bool. The following test is performed:

[Cpp]# Ifndef EXCEL_OP_H# Define EXCEL_OP_H# Include Class ExcelOp{Variant s_vExcelApp, s_vSheet;Bool s_bOpen;Int s_nRowCount, s_nColCount;Protected:Variant GetCell (int row, int col){If (s_bOpen){Return s_vSheet.OlePropertyGet ("Cells", row, col).

Given two strings, character p corresponds to build a subtree, character e is white, and character f is black. Different layers of black spots f correspond to different values, the top part is 1024, and the bottom part is 256 for each subtree .....,

Float: calculates the area of the color from the top rectangle to the bottom rectangle. For each rectangle, it is raised from its position. When it encounters the rectangle above it, it is split into several small rectangles to simulate the floating

At the beginning, enter n to represent an n * n matrix, which indicates the amount of money required from I to j, and then enter the tax required when passing through each city, you do not need to pay taxes on the start and end points. The minimum

This is a classic deep search for dfs. It took a long time to search for this topic without any idea. I don't know how to start it. I searched other people's code online, and I felt that it was well written, in addition, the idea is clear, so I

Question: There are n castles, each of which contains treasures. You must take the most treasures you can obtain from m castles. But if you want to break a castle, the castle on which a depends must be attacked. For example, if a depends on B, B

Shortest Path ....Because the number of points is more than 1000, if the dijstra algorithm o (n ^ 2) definitely times out, the spfa algorithm is used here.The memory is slightly larger because no adjacent table is used. The algorithm is very simple.

[Cpp]/****************************Directly select sorting for a single-chain table*******************************/# Include # Include Struct node{Int num;Struct node * next;};Struct node * head = NULL;Cre_list () // initialize the node{Head =

This question was solved only now when I did not understand the question at the time of last year's research and collection of topics. I am really sorry, ORZ, And it is weak, the status is not very good recently, so you need to adjust your

Concept When a subclass object passes a value to a Base class object, such as foo (Base derived_obj), the copy constructor of this Base class is called. at this time, the sub-class features will be cut, and only the operations related to the base

Introduction: development and maintenance of utility tools may take a programmer's time. Boost simplifies this process by providing several high-quality libraries, allowing you to easily integrate these libraries into your existing code library.

This question is the same as the above question 1201, so we only need to change the weight.Note that there are a lot of questions on this side. Well, I have worked with 100*10005. Later, I wanted to change to a loop queue. I didn't expect that the

Question:Here is a matrix of n * n, with s-colored balloons distributed in the matrix, and k bursts of balloons.Each operation can break a line or a column of balloons of the same color. Q: k operationsThe balloons of those colors cannot be

After reading the problem on hdu, I learned the original principle of rejection. By the way, I reviewed it.There are opportunities for any card in each bag, indicating that each probability will have an intersection. In this way, we will think of a

Question: divide the tree to find the k-digit number in the interval. [Cpp]# Include # Include # Include # Include # Include # Include # Include # Include # Include # Include # Include Using namespace std;# Define inf 0x3f3f3f# Define M 110000Int