C++

First, I analyzed the principles of the Hungarian algorithm: (reference matrix67) after several hours of research, I finally understood. To put it bluntly, you can find a path from the bipartite graph so that the starting and ending points of the

Rotation Lock PuzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission (s): 659 Accepted Submission (s ): 193 Problem DescriptionAlice was felling into a cave. she found a strange door with a number

One word, one word, and one letter exchange, can get another word, such as army-> mary, to become a brother word. Provide a word and find its brother in the dictionary. Describes the data structure and query process. Analysis: There are many

Question: there are 20 buckets with 10 fish in each bucket. The number of fish captured in each bucket is random. Each bucket can only be caught once, ask the total number of 180 sorting items (you can also calculate the probability ). I can

Use the NEW Keyword to allocate memory before explaining how to allocate memory, first, it is easy for beginners to understand the memory partition, memory allocation, constant storage area, heap, stack, free storage area, and global zone. My blog

Problem description: There are n elements. Our goal is to generate a full arrangement of the n elements. Algorithm design ideas: (1) converting the arrangement of scale to n into the arrangement of scale to n-1; (2) converts an arrangement with a

In uboot, the timer is not initialized in the uboot assembly part, but in C. In the void start_armboot (void) function of the C entry function, call [cpp] typedef int (init_fnc_t) (void) using the following code ); [html] init_fnc_t * init_sequence [

This question is very interesting. No algorithm is used, and various situations need to be considered. For example, the range length of two numbers may be more than 10000 characters. When using string storage, you must note that you cannot directly

Today we will talk about the usage and differences between virtual functions and pure virtual functions in C ++. The proposal of virtual functions has been mentioned in my previous article on C ++. It is proposed to solve the ambiguity of

[Cpp]/** Copyright and version statement of the program section * Copyright (c) 2012, student * All rightsreserved from computer College of Yantai University. * file name: object. cpp * Author: Ji Zilong * Completion Date: July 15, March 21, 2013 *

Question: enter an English sentence to flip the order of words in the sentence, but the order of Characters in the word remains unchanged. Words in a sentence are separated by space characters. For simplicity, punctuation marks are processed like

[Cpp]# Include # Include  Using namespace std;Int CountBreakWhile (int n, int MilliSecondsOnce) // The total number of times, each time in milliseconds, can be 0{Static int count = 0; // static If (n {Return 1;}If (count> = n){Count = 0;Return 1; //

Evaluate the k-th small value of any range of a series. Idea: grouping tree template questions, [Cpp]# Include # Include # Include # Include # Define maxn100010# Define mid (l + r)> 1)Using namespace std;Int t [20] [maxn], sum [20] [maxn];Int as

  Both questions are self-defense questions. The first question is a simple decimal self-defense number judgment: Take 376 as an Example376 MultiplierX 376 Multiplier----------2256 first part product = reciprocal first of the multiplier *2632

Simple tree DP I had been RE this question yesterday, and finally wrote the stack with the help of my teammates. Today, I read the code of yesterday and found that I did write it. In every dfs, I had to open a 10000 array, which is not so

The legendary interval dyeing problem After reading several dyeing questions about intervals, I also asked Shen Peng, who only had the brute force method in visual testing .. This is because you only ask once, so it is better to do it. You do not

The parallelization of matrix multiplication is basically based on the jiagnong algorithm, but with the shared memory, I think jiagnong has no advantage. Jia Nong ensures a higher degree of parallelism when each variable is a global single copy.

[Cpp]# Include # Include # Include # Include # Include # Include  # Define JMP_VALUE 12345 Static jmp_buf test_jmp_env; Static void test_alarm (int n){Printf ("alarm signal: % d \ r \ n", n );Longjmp (test_jmp_env, JMP_VALUE );} Void DoSomething

Print? 01 ./*02. * copyright and version Declaration of the program03. * Copyright (c) 2012, a student from the computer College of Yantai University04. * All rightsreserved.05. * file name: class. cpp06. * Author: Wang liqiang07. * completion date:

[Cpp]Example:# Include # Include Using namespace std; Void Test (void){Char * str1 = NULL;Str1 = new char [20];Char str [7];Strcpy_s (str1, 20, "hello world"); // three parametersStrcpy_s (str, "hello"); // two parameters, but if: char * str = new