C++

/********************************************************************* * Author:samson * date:06/04/2015 * Test PL  Atform: * GCC (Ubuntu 4.8.2-19ubuntu1) 4.8.2 * GNU bash, 4.3.11 (1)-release (X86_64-PC-LINUX-GNU) * *********************************

Generalized table-to-tail list storage representation//Xin Yang # include #include #include #include #define Maxstrlen) typedef char SSTRING[MAXSTRLEN+1]; typedef char Atomtype; Defines the atomic type as a character typedef

C language syntax is too dull to change the wording#include #include#defineEnd}#defineif (x) if (x) {#defineThen#definewhile (x) while (x) {#definefunction (x) void function (x) {#defineelse}else{#defineSD scanf ("%d", &x);#defineS (a) scanf ("%d", &

Reference: How to kill processes and sub-processes/** * Incoming parameters: Parent Process ID * Function: Kills the process tree associated with it according to the parent process ID */public static void killprocessandchildren (int pid) {

RewriteThe method of virtual modification with the keyword is called the virtual method. You can declare a method with the same name in the subclass with Override, which is called "overriding." The corresponding method is not modified by virtual, we

Reprint Please specify the source coder extraordinary: http://blog.csdn.net/pearyangyang/article/details/46348633Due to the work of the terminal is directly to the database operation, resulting in each terminal will be stuck, serious impact on

TOJ 1139. Compromise, toj1139.compromise Septem Problem description: Generally, it is to input two paragraphs of text (represented by lowercase English letters), respectively # to indicate the end input of a paragraph, and output the longest common

[Data structure] C ++ is used to implement various operations (including Header deletion, tail deletion, insertion, reverse order, destruction, and clearing) on the double-loop linked list) // [Data structure] use C ++ to perform operations on a

Hdu3658 (matrix fast power) Question: Returns the length of a sequence; This sequence can only have A-Z, a-z; In addition, the asiic code difference between adjacent letters must be smaller than or equal to 32, and one must be equal to 32; There is

Summary of C ++/C debugging InputZookeeper C ++ debugging Input1. Slave FileIfstream cin ("in.txt", ios: in );If (! Cin ){Cerr Exit (1 ); } // Your code Cin. close (); 2. From the character cache areaChar input [] = ""; // input

C ++ code 001 IsValidFileName VC/MFCZookeeper /*File Name check \ n without extension requirements1 is 0 \ n2. The directory is incorrect. \ n3. The file name contains invalid characters \ n4. If the extension is not *, check whether the extension

Poj1_3: Maximum repetition substring (suffix array + RMQ) Description The repetition number of a string is defined as the maximum numberRSuch that the string can be partitionedRSame consecutive substrings. For example, the repetition number of

12470 (matrix power) Formula f (n) = f (n-1) + f (n-2) + f (n-3): n, f (1) = 0, f (2) = 1, f (3) = 2, f (n) is obtained ).Question: a normal Matrix Quick power template question. #include #include const int MOD = 1000000009;struct

Hdu 1576 A/B #include #include #include #include #include #include #include #include #include #include #include

ACdream1139 Sum (push formula + inverse element solution)   Question: Given ~ 9. We calculate the sum of the numbers of adjacent rows and the numbers of adjacent columns. Eg: 123 456 789 The first row consists of 1, 2, 3, 12, 23,123 The numbers in

Solution Report: POJ1226 SubstringsSolution Report: POJ1226 Substrings DescriptionYou are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of

Zoj 3870 exclusive or operation The number of n is given to you, and the number of n is different from each other or greater than the maximum value of the two numbers; Analysis if a is smaller than B and B is larger than B, if B wants a ^ B to be

Hdu5242 Shanghai Invitational competition priority queue + greedy Give you a tree with n points and n-1 points. The starting point is 1. Each point has the right to play k times from the root node to the leaf node. Each time, the game gets the right

Hdu2227 --- Find the nondecreasing subsequences (dp + tree array) Problem DescriptionHow many nondecreasing subsequences can you find in the sequence S = {s1, s2, s3 ,...., Sn }? For example, we assume that S = {1, 2, 3}, and you can find seven

C ++ static class member 1. What are static class members? For all objects of a specific class type, it is sometimes necessary to access a global object. then, the global object will destroy the encapsulation: the object must support the