Others

Although this question is about bitwise DP, Nima is not a combination of mathematics. However, it is implemented by the template's bit-by-bit DP, which is actually the memory-based search. This question is disgusting because there is a negative

Given a tree (not necessarily a binary tree), I now ask how many sides can be deleted at most so that the separated nodes can satisfy the fact that the knots of the separated subtree are even. Idea: first create a tree using an adjacent table, and

This question only requires preprocessing of two arrays, that is, the length of the N numbers retained from 1 to n, and another array that indicates repeated printing of 112123... 123 .. the length of such a string printed to n. The answer is

Question: There are K milking stations and C cows. Each milking station can only serve a maximum of M cows every day. There is a distance between the cows and the milking station, in the matching scheme that can be milked for all the cows in a day,

This reminds me of the three Coke cans of hangdian. It seems that only the number of output times is enough, and all the paths need to be output here, in this way, BFs alone will have a lot of space redundancy in the state of retention. Therefore,

For a number F, set f = p1 ^ E1 * P2 ^ e2... * PN ^ en then the number of mutual quality between [1-N] And d = p1 * P2 *... PN is the same, because the numbers of F and D are not included in their prime factor. For the number of the numbers in [1-N]

Given an N (1-200), evaluate a decimal number of no more than 100 bits. The number is only composed of 0 and 1, and an output is required. Solution: use long for Recursive processing. The Code is as follows: # Include # include # include #

Given a series of stones, this topic seeks to remove some stones and the minimum distance between the two adjacent stones is the maximum. When the enumerated length is D, we can check whether the distance between [0, 1] is greater than D. If it is

DuXiong xuefeiboI Time Limit: 2000/1000 ms (C/other) memory limit: 65535/32768 K (C/other) This organizing committee recommends C and C ++ Problem description Du Xiong has always been very interested in mathematics. I recently learned the Fibonacci

Given a set a, a set B, A, and B have the same number of elements, then, ask if there is a number x so that all elements in a are in the same bit or the result of the operation is a set of B. If there is a minimum number of output, there is no

This is probably the question. Given that log2 (x + y) = A and log2 (x-y) = B, we need to determine what log2 (X) is. First, the range of A and B given in this question is deceptive. In fact, the difference between A and B cannot exceed 1024.

It is equivalent to expression calculation. It uses recursion to process begin as a loop. Multiple statements are processed each time a loop is entered. When the end position is reached, the loop is ended. The Code is as follows: #include #include

The question is very easy to understand, that is, to ask the minimum number of members in the team to be able to see the leftmost or rightmost. We can solve this problem by enumerating none of them as the highest point. One thing to note is that the

For details, see the code: # Include # include # include # include # define t 31 lluusing namespace STD; typedef unsigned long int64; // specify a string, now a series of dynamic operations on this string // the difficulty is that during these

Given a complete graph, we need to divide the graph into two parts and calculate the distance and maximum value of the points after the points of the two parts are cartesian products. Solution 1: since a given number of points can be at most 20, you

For details, see the code: # Include # include # include # define mod 29 using namespace STD;/* obtain the remainder of all the factor pairs at the power of 2004 ^ X, it may be because this year is a leap year. We can split 2004 into 2004 = 2 ^ 2*

For details, see the code: # Include # include # include # include # define mod 9901 // 9901 is a prime number using namespace STD; int A, B; // calculate all the factors of a ^ B and INT num [50], ex [50], idx; // record all the factors and

There are two solutions to this problem. One is to make up for an immature greedy idea through dynamic planning to make the final result correct, and the other is to construct a better greedy strategy. Dynamic Planning relies on the conclusion:

This question is intended to be explained in the code, and it is not easy to understand the optimal value. what we want is the optimal expectation for finding a house under a decision. in fact, one thing we need to do is to order the selection of

This is similar to poj1947. It is also a tree-like DP, because it is written according to the above ideas, which makes it very painful to write. after several hours of adjustment, it was still fruitless. it proves that the meaning of the status is