Others

The former M-1 individual is about the N-1 position of the full arrangement of the case, m Individual can do his own position, in all cases, m people arrange n locations in full. The probability can be obtained by dividing the number of samples by

The Ackerman function is defined as follows:   A (1, 0) = 2 A (0, m) = 1 m> = 0 A (n, 0) = n + 2 N> = 2 A (n, m) = a (A (n-1, m) M-1, m> = 1  Inverse functions of the Ackerman FunctionThe antifunction of the Ackerman function-α (X) is very

use a tree array to find the reverse logarithm... # Include # include # include # include # include # define Max 3000005 # define maxn 10005 using namespace STD; int ans [Max] ;__ int64 C [maxn]; inline void updata (INT s) {While (S = 1) {sum

Because this question is to determine whether a number is an "self-defined number" and whether a number is an "self-defined number" is based on whether there is an ancestor, because the ancestor of a number must be smaller than this number, it is

Determine whether an IP address is a correct IP address. It is convenient to use sscanf for processing. Add a tail character at the end of the data to determine whether there are any additional characters and use the return value of this function.

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2601 How many decomposition methods are there for dividing a number N into I * j + I + J. Idea: If I is used as a dimension and J is used as the second dimension for loop, n = I * j + I + J = I * (J +

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2642 A bare two-dimensional tree array is used to calculate the number of stars in the shiny state in an area. The Code is as follows: #include #include #include #include #include #define MAXN

In the evening, it was a bit cool. This is a transportation system where tickets can be shared. That is to say, when everyone is on a bus, it is enough to meet the requirements of all people to add up less time than the total face value of the

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1540 For a line segment, "d x" indicates that X points are damaged, and "R" indicates that the last damaged point is restored, q X indicates the longest continuous interval of the two ends centered on

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2232 Directly go to the topic. The answer is a combination of conditions that are extremely wide and wide. It seems that when you see this question, we can see how huge the answer to

This question refers to the number of subsequences that are not decreasing in a sequence. In fact, it is a question of reverse order. Here, of course, it is solved by a tree array. First, the input data is discretization to work on the tree array.

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1561 I will not talk about the general idea of the question. All Chinese questions ...... this question seems complicated, and I thought about it during class. For each node, the number of attacks is

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3016 This is a game question. Its name is: it's the next layer for a man. It is to give a series of coordinates, first the ordinate, then the left and right coordinates of the line segment, and finally

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4033 Given the distance from a certain point to N points, can these points form a positive polygon? Idea: select two sides, enumerate the edge length of an edge through the bipartite method, calculate

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1255 Given n rectangles for overlapping image areas, this topic uses the line tree to discretize the Y axis coordinates and uses the Division idea to separate them based only on the X coordinates. We

This is a two-dimensional backpack question. At the beginning, I did not do that. I only opened a one-dimensional space to store the State. As a result, a lot of data did not run. In fact, this question may be a lot clearer. Find the maximum number

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1006 See0o love blue O0After discuss, I finally understood this question. Question requirement: given an angle, the angle between the three pointers on the clock in a day is greater than the percentage

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1864 The meaning of this question is really frustrating. No more than 600 RMB indicates that the total amount of a category of items cannot exceed 600 RMB, and 1000 RMB indicates that the total invoice

This trip to Wuhan can be said to be ups and downs, and all kinds of hard work and joy in this trip are all written in my next flow account. From March 13, April 25, when we bought a returning train ticket, our train ticket went through a long

For each vertex transmitted from the node in the previous step, there is an optimal sub-structure, that is, any point on the correct path will be optimal, and there is an optimal sub-structure. When retaining the optimal value, pay attention to the