Others

Sgu_275 This question can be divided into 64 bits, so we can scan the number from high to low, and try to make the current one 1, to determine whether the current value may be 1, we can use Gauss to describe the element. # Include # Include

Ural_1025 Scan in order. # Include # Include String . H> # Include # Define Maxd 110 Int K, a [maxd]; Int CMP ( Const Void * _ P, Const Void * _ Q ){ Int * P = ( Int *) _ P, * q = ( Int * ) _ Q; Return * P 1 : 1 ;} Void Init (){

Hdu_3333 At first, I couldn't figure out how to do it. Then I looked at other people's questions and found that this question had to be done offline. For the time being, let's talk about the idea of making statistics offline. To enable the

Poj_1830 You can use Gauss to describe the rank of the matrix, so that you can know that there are X variable elements, and these variable elements can take any value. In each case, other elements have a unique solution, so there are 2 ^ x

Ural_1042 The question shows that each worker cannot be replaced by other workers. That is to say, if the column vector of the matrix is linearly independent, the rank of the augmented matrix must be N, so there is no solution, in addition, the

Hdu_3658 F [I] [J] can be used to indicate that the difference between the ASC code value with at least one pair of adjacent characters is 32) (the difference between the ASC code value of any pair of adjacent characters cannot exceed 32, G [I] [J]

At first, we thought about the partitioning stage by column, where one column is placed in one column, in this way, F [I] [J] [k] can be used to represent the number of solutions where a total of J blocks are generated and K blocks are placed in

Hdu_3306 Because N is large, we need to use a binary matrix to optimize the calculation process based on the recursive relationship. According to S (n) = S (n-1) + a (n) ^ 2, a (n) ^ 2 = x ^ 2 * a (n-1) ^ 2 + y ^ 2 * a (n-2) ^ 2 + 2 * x * y * a (

Ural_1052 Obviously, the bullet line will pass through at least two points, so we enumerate any two points is equivalent to enumerating all possible bullet lines, in this way, you can calculate the number of points in a straight line by using the

Poj_1739 Even though it seems that this question is not a loop problem, but because it specifies the starting point and the middle, in fact, we only need to connect the starting point and the end point, this question will become a loop problem,

To find the available block with the smallest number, you can use a minimum heap with the block number as the keyword. In addition, to modify the duration of the block being used and to free out-of-date blocks in a timely manner, you can also open a

Sgu_223 I just learned about plug.DPSo plug-ins are used.DPThis question is written in that mode. If recurrence by grid, only the grids on the left, top left, top, and top right of the grid will affect whether the current grid can be

Ural_1014 The basic greedy idea is to leave as few items as possible, and the Lexicographic Order of these items is as small as possible. Therefore, 8 should be generated first, 9, 6, 4 should be generated first, and the prime number should be

Ural_1026 Sort in order. # Include # Include String . H> # Include # Define Maxd 100010 Int N, K, a [maxd]; Char B [maxd]; Int CMP ( Const Void * _ P, Const Void * _ Q ){ Int * P = ( Int *) _ P, * q = ( Int * ) _ Q; Return * P 1 : 1

Sgu_222 I just learned about plug.DPSo plug-ins are used.DPThis question is written in that mode. AvailableF [I] [J] [st]Indicates pushIRowJColumns, rows and columnsRookThe status isStNumber of solutions. # Include # Include String . H>#

Ural_1024 In fact, it is to find the least common multiple of several cyclic nodes. The question shows that the data will ensure that the final result is not greater than 10 ^ 9, but the case of over Int Is well constructed, let the length of the

Hdu_2656 Because K is relatively small and Y is also within the int range, you can generate a larger arrangement than X until K is generated. # Include # Include String . H> Int X, K; Struct INTEGER { Int A [ 32 ]; Void Init ( Int X ){

Hdu_1828 I used to write this question only with the idea of discretization. Now I have written it again with the online section tree. If you want to scan the perimeter only once in one direction, you need to calculate the perimeter of the

HDU_2276 This question reminds me of the recently learned time series logic circuit of digital power ...... The current status of the light depends on the status of the light on the left and the status of the light on the top of the previous time.

HDU_1964 To solve this problem, you only need to rewrite the dp equation for the number of loops to the dp equation for the optimal solution. For more questions about plug dp, refer to Hu Hao's blog: