C++

The example in head first design mode is very good, want to create an automatic trading candy machine, candy machine has four states: insufficient investment money, enough money to sell, Candy sold, Candy sold out. When the current state of a candy

ClassA class is an abstraction and encapsulation mechanism that describes a set of objects that have the same properties and behavior, and is the basic unit of code reuse.Access rights for class membersOne of the object-oriented key characteristics

Yang Hui Triangle/* #include int main () {int i=0,j=0;    int a[11][11]={0}; A[0][0]=1;for (i=1;i Static indicates that the array is initialized to 0;eg:static int a[10][10] equal to int a[10][10]={0}; Arrays are not allowed to be crossed,

method One: Using reference counting: #includeusing namespacestd;classobject{ Public: ~Object () {count=1; } Object () {if(count==0) {cout"This class can only create one object! "; return ; } --count; }Private: Static

1. New keyword:1), creating objects2), Hide members inherited from the parent classWhat is object-oriented?A way to analyze the problem (enhancing the scalability of the program)Three main features of object-oriented: encapsulation, inheritance,

Common grouping Syntax category Code/Syntax Description Capture (exp) Match exp, and capture text into an automatically named group (? exp) Match exp, and capture the text to a

Process Memory layout (x86 schema)--------------------------------------------------------------------------0x08048000 Code. Text, codes, read-only Data, whichcontains the already initialized, read-onlyBSS. BSS, uninitialized data, initialized to 0,

Lazy uctor, lazypolicuctor DescriptionA math extends uctor is too lazy to grade a question in the exam papers in which students are supposed to produce a complicated formula for the question asked. students may write correct answers in different

[C ++ design mode] adapter Mode In STL, the stack encapsulates the vector or double-end queue, and the stack operation interface is a typical adapter mode. The adapter mode is used to convert an interface of a class to another interface that the

[C ++ design mode] command mode In software systems, "behavior requestor" and "behavior implementers" are usually "tightly coupled ". However, in some cases, such as "record, undo/Redo, and transaction" operations, it is not suitable for tight

1336-Fixing the Great Wall (DP) This topic is extremely classic. It is the calculation of "future costs" in dynamic planning. Because the starting point is fixed and the repair time is ignored, the points repaired at any time must be a continuous

Ultraviolet A 673 Parentheses Balance   Parentheses Balance You are given a string consisting of parentheses()And[]. A string of this type is said to beCorrect: (A) if it is the empty string (B) if A and B are correct, AB is

HDU4149 Magic Potion (bitwise Operation)   Question: returns the result of an exclusive or operation between x1, x2, x3, x4, x5, x6, x7, and x8 and a value of m ~ Sum of the sum of x8 and the result sum after m's XOR operation, evaluate

HDU 4135 Co-prime) Question stamp here Question: How many elements are there in a range [a, B] with n. Ideas: This is one of the template questions about the principle of rejection. For details about the principle of rejection, please refer to the

Codeforces 240F. TorCoder line segment tree   The line segment tree counts and maintains the number of letters in a certain interval ....    F. TorCoder time limit per test 3 seconds memory limit per test 256 megabytes input input.txt output

ZOJ 3527 Shinryaku! Kero Musume (tree DP) 2300 years ago,Moriya SuwakoWas defeatedYasaka KanakoInGreat Suwa War. As the goddess of mountains inGensokyo, She was planning to make a comeback and regain faith among humans.     To achieve her great plan,

[Digital dp] hihoCoder 1033 staggered and Question: Ask you all the vertices in the [l, r] range that satisfy each digit plus one minus the sum of all vertices of k. Ideas: Digital dp Dp [site] [sum] [p] [k] represents the site bit, sum, current

Poj 2774 Long Message suffix Array    Long Message Time Limit:4000 MS   Memory Limit:131072 K Total Submissions:23327   Accepted:9566 Case Time Limit:1000 MS   DescriptionThe little cat is majoring in

Poj 1258 Agri-Net (Prim) (basic)Agri-Net Time Limit:1000 MS   Memory Limit:10000 K Total Submissions:44487   Accepted:18173 DescriptionFarmer John has been elected mayor of his town! One of his campaign promises

Hdustm5aeroplane chess probability dp questions// There are n + 1 grids from 0 to n// For the grid I, the number of dice is x, so the number can be from position I to position I + x// There is a line between the grids. If there is a line between the