C++

Title: Age CoincidenceXiao Ming and his cousin go to the movies, some people ask their age. Xiao Ming said: This year is our lucky year ah. The four digits of my year of birth add up to just my age. The same is true of cousin. Known this year is 2014

Number of combinationsChoose 2 from 4 people to participate in the event, a total of 6 kinds of election method.How many options do you have to choose m individuals to participate in an activity from n individuals? The following function implements

Article reference "Ditte video"The following scenario may occur in object-oriented:--the base-class pointer points to the child class object--base class reference, which becomes the alias of the subclass objectbase* p = new Derived ();base& r =

About pointer, be sure to eliminate the "wild hands"! The following code defines a pointer to the NVIC_INITTYPEDEF struct type, but does not initialize the pointer with a "piece of memory address", so it is a wild pointer!Since it is not initialized,

The definition of a pointer:the pointer is the address, and the address is the pointer .The pointer variable is the variable that holds the memory Unit number , or the pointer variable is the variable that holds the address .Pointer variables and

The error originates from compiling the Eudev with the g++ cross-compilation toolchain. After a search, it was found that there is an extern definition of program_invocation_short_name in the errno.h header file.After viewing the source code of

Writes a function, opens a file in read mode, reads its contents into a string vector, saves each row as a separate element in the vector, and outputs it.Idea: 1. Open the file "directory. txt" in read mode;2. Create a String object line and use

In the C language, it is sometimes necessary to perform a bitwise operation, such as for some of these bits. The purpose of this is to achieve the goal, without affecting the other bits. The usual set-up operations are as follows:#define SETBIT (x,

1#include string.h>2 #defineMAXN 203 intA[MAXN][MAXN];4 intMain ()5 {6 intN,x,y,tot =0;7scanf"%d",&n);8Memset (A,0,sizeof(a));9tot = a[x=0][y=n-1] =1;Ten while(Tot N) One { A while(x+11][y]) A[++x][y] = + +tot; - while(

first, the topicBased on the last randomly generated 100 vertices of the graph and the direction of the graph, it is a breadth-first search.second, understanding breadth First searchBreadth-First search can think of it as a circle of ripples of

The full and partial specificity of class templateClass templateTemplateclass test{public: Test (T1 i,t2 J): A (i), b (j) {cout" template class "Endl;} Private : T1 A; T2 b;};Full specificityTemplate<>class testintchar>{public: Test (

Calling a function in a2.c in the source file a1.cThere are two ways of doing this:1. There is a complete function definition in a2.c, add the function prototype (declaration) to be used in a1.c, for example:In a2.c: There is a function void A2 () {.

Int,bool,decimal, etc. as a value typeList,stream, etc. as a reference typeWhen you set a value type variable equal to another variable with an equal sign, the copy is completed, and then the two variables have no effect on each other;When you use

1. Reasons:Task completion in the project has a hint that needs to be animated to show, the effect is as follows:This is the old project for Delphi written, instead of C # implementation, this effect to do some design. This is not difficult, small

What is a recursive function/method?Either method can invoke other methods and call itself, and when this method calls itself, we call it a recursive function or a recursive method!There are usually two characteristics of recursion:1. The recursive

This article simply extracts several design patterns to be implemented in terms of polymorphism and entrustment, although the emphasis here is not on design patterns, but in order to make readers understand the delegates better. So many details of

1.this.   Close (); Just close the current window, if it is not the main form, you can not quit the program, and if there is a managed thread (not the main threads), also can not cleanly exit;2.application.exit (); Forces all messages to abort,

Adjacent table templateLThe Processing Method of the adjacent table is as follows:LVertices in the graph are stored in a one-dimensional array. Of course, vertices can also be stored in a single-chain table. However, Arrays can easily read vertex

Graph traversal (bfs + dfs) template, bfsdfs Bfs 1 #include 2 #include 3 #include 4 using namespace std; 5 queueq; 6 int map[1001][1001]; 7 int vis[1001]; 8 int n,m; 9 void bfs(int p)10 {11 q.push(p);12 vis[p]=1;13

Simple operations to stretch a Splay tree The splay tree is a binary sorting tree. [I wrote it two months ago. Today I suddenly want to write a blog ...] Different from the general binary sorting tree, the tree is automatically balanced after each