C++

One: Special string macros[CPP]#define A (x) t_# #x#define B (x) #@x#define C (x) #xWe assume x=1, then the macro definition above will be interpreted as followsA (1)------>t_1B (1)------> ' 1 'C (1)------> "1"These are mainly used for some string

In a multi-threaded environment, we always have to use locks. So a common scenario is:1 classObjectwithlock2 {3 Private:4 Std::mutex mtx_;5 Somerestype Shared_res_;6 7 Public:8 //Constructor/destructor9 ... ..Ten One voidoponsharedres () A {

1 classTest (object):2 defrangetest (self):3 forIinchRange (2,0,-1):4 PrintI5 PrintI6i=27 whileI>0:8 PrintI9I=i-1;Ten PrintIAs shown in this code, the output results arefor (2 1)1while (2

Method 1: Call the ping command of CMD. Private Static string strip Ping (string strip) { PROCESS p = new process (); p. startinfo. filename = "cmd.exe"; // set the program name P. startinfo. useshellexecute = false; // close shell usage P.

/* Description: The program inserts columns, inserts rows, and exchanges two elements at the specified position in a two-dimensional array, and outputs the change track of the element at the specified position. Author: Socrates Date: 2014-08-17 */#

Address: http://blog.csdn.net/xutao_ustc/article/details/6314057 class Program { static void Main(string[] args) { Data[] array = new Data[] { new Data() { a = 1 }, new Data() { a = 3 }, new Data() { a = 2 } };

Perform statistical analysis on some data as needed. The first step of statistical analysis is data query. The query results are the result set of a row and column table. The IT database concepts such as rows, columns, and tables correspond to the

Next blog Private void formateload (Object sender, eventargs e) {hashtable ht = new hashtable (); getvalue (HT);} private void getvalue (hashtable HT) {hashtable newhash = new hashtable (); newhash = HT; newhash. add ("QQ", "33 ");} In the above

C # image loss occurs when the image is saved using the default method. The following method is provided: 1 /// 2 /// lossless save picture 3 /// 4 /// picture 5 /// saved path 6 // image type, image/JPEG, image/PNG, image/GIF, image/tiff,

A little pony and crystal mine Q: print a diamond pattern with an odd number of n. The entire figure occupies N x n. For example, ---> input 3, the print pattern is as follows: *D*DDD*D* Algorithm: The number of rows separated by D is the

The same string constants are shared and cannot be written. 1 # include 2 using namespace STD; 3 4 char * string1, * string2; 5 6 int main () {7 string1 = "ABCD"; string2 = "ABCD "; 8 If (string1 = string2) printf ("strings are shared! \ N "); 9

Sharing the condition in juc is rare. I have seen most of the articles about boundedbuffer. Today, I will start with several methods of the condition interface, and then I am putting boundedbuffer into a deadlock. Let's see what condition needs to

Ultraviolet-10118 Free Candies (memory-based search) Question: Ultraviolet A-10118 Free Candies (memory-based search) Here are four piles of candy, each of which has a color. Each time, you can only take any pile of top candy and put it in your

POJ3311 Hie with the Pie pressure DP Today, I finally got two questions like this. I won't mention the first question. It's totally because the question has not been judged due to special circumstances. It's basically just a matter of attention.

Dynamic Planning for contract baseball free players Suppose you are the general manager of a major league baseball team. You need to sign in to some free players during the offseason. The team boss gives you a budget of $ X, and you can use less

HDU 1068 Girls and Boys (Maximum Independent Set = number of vertices-Maximum number of matching) HDU 1068: Question Link Some boys and girls give relationships with people and then ask how many people do not know each other. Switch: the largest

POJ 3264 RMQ Spare Table Algorithm I didn't understand what the Emperor said this afternoon. So I followed the course and learned the state transfer equation in the middle several times. So I wa. Several rounds. # Include # Include #

Hdustm9-series of stories-weight loss II (line segment tree)Weight loss IITime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission (s): 2395 Accepted Submission (s): 1018Although Problem Description has

Poj3322 Bloxorz I Classic box games The minimum number of steps for a 1*2*1 brick reaches a specified hole. Obviously bfs, the State indicates that a P value 0, 1, and 2 respectively indicate that the bricks are standing, lying horizontally and

NYOJ 2 bracket matching /*Question: Check whether parentheses are pairedSolution: open an array B to act as a stack. top controls the inbound and outbound stacks for the next subscript of the stack.Difficulties: see the codeKey Point: a deep