C++

Http://greatverve.cnblogs.com/archive/2012/10/24/cpp-int-string.htmlThis thought for so many years C # experience, learn a C + + not much difficult, now found wrong. C + + True TM difficult.Today encountered int turn string tripped half a day, the

1. Proxy modeProvides a proxy for other objects to control access to this object. Remote Proxy: Provides a report representative for an object in a different address space. This can hide the fact that an object is in a different address

1. Factory Method ModeThe first is an interface for creating an object, letting the subclass decide which class to instantiate. The factory method defers the instantiation of a class to its subclasses.* Factory method mode overcomes the disadvantage

University of Virginia   Zishu example p245   Piotr found a magical box in heaven. its magic power is that if you place any red balloon inside it then, after one hour, it will multiply to form 3 red and 1 blue colored balloons. then in the next hour,

C ++ four different object survival methods and four object survival methods In C ++, there are four methods to generate an object. The first method is to generate in the stack: Void MyFunc () { CFoo foo; // generate the foo object in the

Board coverage (recursive grouping), Board coverage recursive grouping Problem description: In a checkerboard consisting of 2 ^ k × 2 ^ k squares, if there is a square different from other squares, it is called a squareSpecial SquareAnd is called a

C ++ copies constructor and six major functions, six major constructor Functions 1. When will C ++ call the copy constructor? A. An object is used as a function parameter and passed in the function body as a value; B. An object is used as the

HDU 2586 How Far Away? (Evaluate the lca of the Tarjan offline algorithm) A tree is given with n nodes and m queries. The distance between the two nodes is queried each time. Train of Thought: Find the lca of the Tarjan offline algorithm. At the

POJ topic 2245 Lotto (DFS water)Lotto Time Limit:1000 MS   Memory Limit:65536 K Total Submissions:6549   Accepted:4153 DescriptionIn the German Lotto you have to select 6 numbers from the set {1, 2 ,..., 49 }. A

LeetCode-Merge IntervalsProblem description: Merge intervals of one group, for example, [2, 4] and [3, 6], into [2, 6].Implementation ideas:1. Sort the minimum values of the intervals (O (N * Log N ))2. traverse and merge based on different

Poj 3370 Halloween Treats   Description Every year there is the same problem at Halloween: Each neighbor is only willing to give a certain total number of sweets on that day, no matter how many children call on him, so it may happen that a child

ZOJ 3575 Under Attack III   Under Attack III Time Limit: 7 Seconds Memory Limit: 65536 KB   Due to the successful resist in Under Attack II, the enemy lost most of their bombers and our ground forces are advanced for viccing. however, our

POJ 3411 Paid Roads (DFS) From the first city to the nth city, you need to use a, B, c, and p for each m Road, r indicates that when you go from City a to City B, if you pass through or are currently in City c, the toll will be p yuan. Otherwise, it

Hdu 1283 simplest computer  Simplest computer Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 5707 Accepted Submission (s): 3184 Problem Description a research organization named PigHeadThree

Codeforces 547B Mike and Feet (monotonous stack)B. Mike and Feet time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Mike is the president of country What-The-Fatherland. There areNBears

C ++ understands function objects and lambda expressions Refer to Chapters 21st and 22nd of 21-day learning C ++ to introduce function objects. At the same time, you can use lambda expressions as an anonymous function object to gain a more concise

Poj1222 -- extended lights out (Gaussian element elimination)   The matrix of 5*6 is given. Each grid is a switch (on is 1, off is 0). Every time a grid is changed, the grid itself and its upper, lower, and lower sides change, ask what operations

NOJ 2079 Prime (Mobius Inversion)   Prime Time limit (Common/Java): 1000 MS/3000 MS running memory limit: 65536 KByteTotal submissions: 267 pass the test: 11 Competition descriptionGiven the number of n, calculate the logarithm of the two mutex.

HDU-3416 Marriage Match IV (maximum Stream) A person wants to go to City B from City A, and each road can only go once. Solution: the difficulty is to know whether the problem is the most short-circuited.First, obtain the shortest path from B to

1686 hdu Oulipo (number of times the mode string appears in the text string) Code:   # Include # Include Using namespace std; char a [1000005], B [10005]; int next [10005]; int LCPS [10005]; int n, m; void GetLCPS () {int j = 0; int