C++

First, I will discuss the knowledge about memory. When I mentioned memory leaks and frequent use of new and delete in the above blog post, I discussed it with my colleagues, in practice, it can be used to avoid this problem. I first studied the

After learning the bubble sort, we will find that this algorithm is constantly compared and exchanged. Although simple and straightforward, it clearly gives people a complicated feeling. Is there any better algorithm? This is of course, and it is

Calculate all the prime numbers not greater than n. The better algorithm is the sieve method of elastostany: returns the range n of the values to be screened, and finds out the prime numbers. First use 2 to screen, that is, leave 2, remove the

Chapter 1 about Data Structure 1. What is the research on data structure? (The objects processed by a computer are composed of numeric values> non-numeric values.) A large number of complex problems (non-numeric problems) in real life are identified

[Cpp] // /// // UDPClient file # include ".. /common/InitSock. h "# include CInitSock initSock; // initialize the Winsock database int main () {// create a set of characters SOCKET s =: socket (AF_INET, SOCK_DGRAM, IPPROTO_UDP ); if (s =

In the c ++ standard template library, there are three types of containers: sequential containers, associated containers, and container adapters. An ordered container is a linear ordered cluster. The underlying implementation relies on linked lists

The ref Library provides the template factory functions boost: ref and boost: cref in boost/ref. hpp, which correspond to the packaging references and common references respectively. If you need to copy object parameters in some cases, you can

When testing and developing the kernel module, we found a BUG: If the module is not uninstalled and the reboot command is used to restart the system, the system cannot be restarted, check the log and find that the created kernel thread is in an

First, we need to clarify what COM object is passed. In general, if we want to manipulate pages in the browser, they all start from the IWebBrowser interface object. Here we also want to pass this interface object [cpp] VOID SetWebBrowser (CComPtr &

This article describes how to convert a GDI + bitmap to a PCX image. The following is the code for converting a GDI + bitmap to a PCX Format Image: [cpp] INT PackPcxLine (LPBYTE dest, LPBYTE source, INT bytesPreLine, INT planes) {LPBYTE pd = dest;

Windows: Use the CoCreateGuid function (GUID) [cpp] # include # include # define GUID_LEN 64 int main (int argc, char * argv []) {char buffer [GUID_LEN] = {0}; GUID guid; if (CoCreateGuid (& guid )) {fprintf (stderr, "create guid error \ n");

Simple requirement analysis. Even those who have played the connected viewing know that the connected viewing is actually testing whether to connect two points (images) with less than or equal to three connected lines ). The number of lines is 0 ~ 3.

Dijkstra, however, considers the common shortest single-source path as the maximum single-source path. Operators are multiplication rather than addition. The Double type is used for storage. The details need to be carved before submission. Question:

Thinking about a common problem in interface inheritance when designing the DirectUI interface library (this interface library is now open-source and can be downloaded here) architecture, I encountered an interface inheritance problem, at that time,

C language source code: [cpp] # include int s [110] [110]; int m, n; void dfs (int I, int j) {s [I] [j] = 0; if (I> 0 & s [I-1] [j] = 1) dfs (I-1, j ); if (I 0 & s [I] [J-1] = 1) dfs (I, J-1 ); if (j 0 & j> 0 & s [I-1] [J-1] = 1) dfs (I-1, J-1 );

C language source code: [cpp] # include int max1 [101], max2 [101]; int main () {int I, j, n, num, a [101]; while (scanf ("% d", & n )! = EOF) {for (I = 1; I max1 [I]) max1 [I] = max1 [j] + 1 ;}} max2 [n] = 1; for (I = n-1; I> = 1; I --) {max2 [I]

[Cpp]/* AOV network and topological sorting 1. In a directed acyclic graph, vertices are used to represent activity, and directed edges are used to represent activity u first and activity v, this directed graph is called the AOV network. 2. If , u

PieTime Limit: 1000 MS Memory Limit: 65536 KTotal Submissions: 7639 Accepted: 2817 Special JudgeDescriptionMy birthday is coming up and traditionally I'm serving pie. not just one pie, no, I have a number N of them, of various tastes and of various

Line Segment tree + Spanning Tree dyeing, Standard O (nlogn), no longer have to worry about being stuck... [Cpp] # include # include # include # include /* # include # include # include # include # include # include # include # include */#

[Cpp] int evaluate (unsigned int num_regions, # if LINUX_VERSION_CODE> = KERNEL_VERSION (, 26) struct dm_io_region * where, # else struct io_region * where, # endif int rw, struct bio_vec * bvec, io_policy_fn fn, void * context) {struct