C++

# Ifdef MTK_ASSERT# Define assert (p) do {\If (! (P )){\LogPrint ("Assertion failed: % s \ nFile: % s \ nLine: % d \ n", # p, _ FILE __, _ LINE __);\_ Asm {int 3 }\}\} While (0)# Else# Define assert (p)# Endif  From Baidu Encyclopedia:INT3

I. C ++ STL containers have some common capabilities The three core capabilities are: (1) All containers provide "value Semantics" rather than "reference Semantics ". When the container inserts an element, the copy operation is performed internally

Today, I read the related development documents and Sample programs of Windows 8 provided by Microsoft, and found that the expression of a C ++ program is similar to that of tianshu, it turns out to be a new Lambda expression supported by C ++ 0x/11.

First, what we did at the beginning is messy:[Cpp]/* The program is made by pyy *//*----------------------------------------------------------------------------//Copyright (c) 2012 panyanyany All rights reserved. URL:

★Similarities: 1. All are addresses; The Pointer Points to a piece of memory, whose content refers to the address of the memory, and the reference is the alias of a piece of memory. ★Differences: 1. the pointer is an entity, and the reference is

Use string to replace the char * array, use the sort Sorting Algorithm to sort, and use the unique function to return and return duplicates.1. DefineString s1 = "hello ";String s2 = "world ";String s3 = s1 + "," + s2 + "! \ N ";2. appendS1 + = ",

Given an n-order matrix A, calculate the value of the main diagonal of the K-power matrix of A and the value of the modulus 9973. Solution: the rapid power of a matrix. Can I write a matrix class and then write a few corresponding functions, such as

How many factorial digits are there in 1000? How many consecutive zeros are there?There is a factorial FormulaFor example, 1000 factorial digits:Log10 (1) + log10 (2) + · + long10 (1000) is rounded up and then added to 1OrLog (N !) = LnN! /Ln10=

Generally, Multiple Input and Output groups are used for various programming competitions, and the input and output have high normative requirements for the format (which facilitates automatic question determination and verification ), here are a

Const member functionsThe main value of a const member function lies in the const object. We know that the const object cannot be modified. To ensure that the const object cannot be modified, the compiler stipulates that the const object can only

This question refers to breaking down big numbers. The number range is Longlong, and it seems that it cannot be violent. However, the question provides a condition, with at most one reasonThe child size exceeds 1000000. Haha, This is a storm. In

It is obviously the number of remaining Chinese understandings.The Chinese Remainder Theorem is not very useful, attention .... Use three equal signs to represent the same remainderN = a1 (mod r1)N = a2 (mod r2)Take two for example, x = a1 + r1 * x =

Jia Zhihao mentioned this kind of game in his paper: A Brief Introduction to combined games -- several extensions and variants of SG gamesThe following direct reference theorem and proof[Theorem] (SJ theorem) for any Anti-SG game, if we specify that

Wa is a bit speechless. I can't afford to hurt a lot of questions with more details...# Include # Include # Include # Include # Include # Include Using namespace std;# Define pb push_back# Define read freopen ("out.txt", "r", stdin)# Define write

Original question:A grid that wraps both horizontally and vertically is called a torus. given a torus where each cell contains an integer, determine the sub-rectangle with the largest sum. the sum of a sub-rectangle is the sum of all the elements in

Poco: ThreadPool provides the thread pool function to reduce the overhead of thread creation and destruction, and is suitable for applications on servers. When creating a thread pool, specify the minimum number of running threads and the maximum

To Be NUMBER ONETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 383 Accepted Submission (s): 190Special Judge Problem DescriptionOne is an interesting integer. This is also an interesting problem.

Question 2 Question: A stack is required. The stack contains the min function, that is, min, pop, and push operations can be performed in O (1) time. Analysis:Because the traditional stack only supports the push and pop functions, the push and pop

The offset vector is also used. A numerical string consisting of 0, 1 ~~, Now, you have some questions about whether the number of numbers from I to j is an odd or even number. He will tell you the answer, but the answer may be self-contradictory.

The meaning of the question is somewhat elusive ~~ After reading this question for a long time, I learned this question. I used a variety of STL water ~~ Stack, map + stack... I thought the efficiency would be very low ~~ However, the time is 80 ms ~