C++

1. C ++ programming-debugging mark Applicable to preprocessing # define to define one or more debugging tags. In the code, use # ifdef and # endif for debugging management. After the program is finally debugged, you only need to use the # undef flag

1. Connection function strcat The function prototype is strcat (char [], const char []). Strcat is short for string catenate. This function has two character array parameters. The function is used to connect the strings in the second character array

I. Examples Taking my previous File System (FileSys) as an example: A file system is an independent system that provides a set of core file operations. In addition to the file system, there are four subsystems, namely the KillVirus, ZipFile,

Given a matrix of n * m, there are numbers 0 and on the matrix, which indicate that the coordinates can be placed. The objects to be placed cannot be adjacent. How many put methods are there? N, m Solution: In simple state DP, dp [I] [j] indicates

Type: brute-force enumeration, search Question:You are responsible for ordering a large pizza for you and your friends. each of them has told you what he wants on a pizza and what he does not; of course they all understand that since there is only

Given a prime number p and a string str. F [I] = Num (str [I]), Num (str [I]) indicates 0 when str [I] is, str [I] is str [I]-a + 1 when it is a-z.Then we obtain the n (str [I] length) equations. The format of each equations is (a1 * k ^ 0 + a2 * k ^

The question is quite tangled and I searched for the question.Returns a prime number P (P F (1), f (2)... f (n ). Definition: f (k) = Σ 0 Solution: Gaussian elimination. According to the above formula, we can clearly list the n equations with n

This question seems to be easy to build. In fact, the maximum flow with bare minimum cost will inevitably Time Out, And the zkw billing flow will also time out. Therefore, you must understand the meaning of the question. The question must be better

A tough question First, the input is very painful. According to the online experts, the question matrix is reversed. Then I gave it back. If it is a match between n and n, there is no pressure to directly obtain the negative value of KM. However, if

FruitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 1781 Accepted Submission (s): 1035 Problem DescriptionIn the twinkling of an eye, Lele received a bumper harvest due to the professional

Question: There is a string of numbers. to sort them in ascending order, two numbers can be exchanged each time. The price of one exchange is the sum of the two numbers. The minimum cost is required.Http://poj.org/problem? Id = 3270This is a classic

GCD AgainTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 1542 Accepted Submission (s): 578 Problem DescriptionDo you have spent some time to think and try to solve those unsolved problem after

Returns the length of the longest common substring of two strings using a suffix array. For more information, see Luo Sui's paper. [Cpp]# Include # Include # Include # Include # Include # Include # Define maxn1000005Using namespace std;Int r

Question: There are m people in a circle, there are two Frisbee, 1/2 of the probability of throwing to the left to the right, the first two frisbee are separated by n, ask the expected number of times of two Frisbee to a person's

CompromiseTime Limit: 1000 MS Memory Limit: 65536 KTotal Submissions: 4965 Accepted: 2266 Special JudgeDescriptionIn a few months the European Currency Union will become a reality. however, to join the club, the Maastricht criteria must be fulfilled,

Question: activation sequence of xian5. There are four situations: 1. Registration failed, but the queue sequence is not affected. The probability is p1. 2. The connection fails. the first person in the team is at the end of the team. The

Paint ChainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 696 Accepted Submission (s): 252 Problem DescriptionAekdycoin and abcdxyzk are playing a game. they get a circle chain with some beads.

Coordinates make me dizzy. I first typed a table to store the number of solutions with a letter starting with I. Then, it is decomposed from the input string: Assume that it is a cdvx string, and add the number of all solutions with a length of 1, 2,

Today, a student asked me some questions about big data, one of which is representative, such as determining whether a url is in the Set, 10 URLs, and whether a url is in the set, for example ~ 1 million consecutive unordered numbers, random N

The discussion here is not about the advantages and disadvantages of languages, but about code writing. I have read the code written by c/c ++ programmers and the code written by java and c # programmers.C/c ++ is like a frugal rich generation, and