C++

implements a function that evaluates the length of a string and does not allow the creation of third-party variables. #include #include int my_strlen_no (char const *p) {ASSERT (P! = null); if (*p = = null) return 0;elsereturn (1 + my_strlen_no (p +

The sort method is provided in the C + + template, which generally has two methods: passing a function and passing an object.The first method: functionbool Compare (conststringconststring &strright) { return strleftstrright;} int main ()

#include using namespace STD;TemplateintN>classa{ Public:enum{result = N + A1>::result};};Template<>classa1>{ Public:enum{result=1};};intMain () {cout ->::result the//vs2013 below can be up to 500 of the depth of recursion. //Because the

See Python found that there is such an API, it feels very practical, think of the STL will have this? It's been a long day without a result. So I realized it with lambda.Take Vector as an exampleTemplateVector Argsort (const vector& a) {int Len =

Use a macro to implement a reshape parity bit exchange//For example 6 for 0000. 0110, swap out for 0000. 1001, which is 9#include #define EXCHANGE (num) ((num& (0x55555555)) >1) Remove the odd digit shift left, remove the even digits to the

A /C + + data alignment Rolluphere are two sentences to summarize the principle of data alignment:(1) for n-byte elements (n=2,4,8,... ), its first address can be divisible by n, the ability to obtain the best performance;(2) If Len is the longest

[CPP]View Plaincopy int main (int argc, char* argv[]) { Map MapData; mapdata["a"] = "AAA"; mapdata["B"] = "BBB"; mapdata["C"] = "CCC"; for (map::iterator i=mapdata.begin (); I!=mapdata.end (); i++) { if (I->first = =

Do not use loops and judgment statements to find out the 1-100 and # include int fun (int n, int. *sum) {*sum = *sum + N; (n--) && (Fun (n, sum)) ; return n;} int main () {int n = 100;int sum = 0;fun (n, &sum);p rintf ("%d\n", sum); return 0;}

1. What does the value of I output? #include "iostream.h"int i=1;void Main (){ int i=i;cout}Answer:I is a value that is undefined. Because you re-defined a local variable i in the main function, and it's not initialized, its value is a random value.

1#include 2 3 intMain ()4 {5 structDate6 {7 intYear ;8 intmonth;9 intDay ;Ten }; One A - //type - structStudent the { - intNo//School Number - - structDate birthday;//

DropDownList control binding enumeration data in C # ASP1. Enum (enum) code:Private enum heros { 0, ten, +, , }If you do not specify values for the elements in the enumeration list, their values are automatically

Automatic property initialization (initializers for auto-properties)That's what we wrote before.Adding a background field to a default is not so bad, now we can write it like thisInitialization of Read-only properties (Getter-only

Extension methodsThe class and extension method where the extension method resides must be static and the first parameter of the extension method is the class name to extend and theperson person = new person ();public static Class Extension{public

1./* Round up for aligment */#define ROUND_UP (x, Aligment) ( (((x) + ((aligment)-1) /(aligment) ) * (aligment) ) ROUND_UP (7, 5) = 102. Negative number for modulo operation ( -7 5 = 3, 7 plus 3 divisible by 5)void*memcpy (DSTPP, Srcpp,

Title Address: PortalAlthough this question is DIV1 C. But it's quite simple. As long as the line tree to maintain the horizontal and vertical values can be, the first discretization and maintenance. Each time you find the maximum minimum value of

HDOJ----------1009, hdoj1003. Question:FatMouse 'trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 52127 Accepted Submission (s): 17505Problem DescriptionFatMouse prepared M pounds of cat

BZOJ 2152 Cong Coco (tree Division) Address: BZOJ 2152Find the number of vertices with the sum of three. The simplest point grouping.The Code is as follows: #include #include #include #include #include

Use of vector in C ++(1) vector identifier;(2) vector identifier (maximum capacity );(3) vector identifier (maximum capacity, initial values );(4) int I [4] = {12, 3, 4, 5 };Vector vi (I, I + 2); // obtain the value after I index value is 3; (5)

Optimization of hdu 2829 dp + quadrilateral Inequality   W [I] [j] indicates that no edge is destroyed between I and j. There is a good proof that w [I] [j] satisfies the conditions of quadrilateral inequality. if (w [I + 1] [j]-w [I] [j]) is a

HDU 1016 Prime Ring Problem (Deep Search)Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 32872 Accepted Submission (s): 14544Problem Description A ring is compose of n circles