Others

/* Question: Queen's problem, board problem, simple DFS. You just need to pay attention to a detailed solution: traverse through rows directly. However, DFS (I + 1, POS) can be used to identify this vulnerability with his first test data. */#

/* Question: give a few numbers as weights to see which cannot be claimed. Solution: first, find all the situations that can be added to the backpack, and then brute force find out the situations where subtraction can be used. When the variable I

/* Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1210 this question can be found out based on the subject. For example, when n = 4, 1 2 3 4 5 6 7 8 to the third step will find the full reverse order. If 1 reaches the initial

/* Question: the same as a poj Board question, however, it is necessary to determine the case that it cannot be a diagonal line */# include # include # include using namespace STD; int res [12]; // Save the expected output result int Visi [12]; //

Compositions Time limit:5 seconds Memory limit:32768 KB We consider problems concerning the number of ways in which a number can be written as a sum. If the order of the terms in the sum is taken into account

And query sets to maintain connectivity Each Unicom quickly enumerates the Ignited vessels and then finds the minimum time for burning all Finally, find the maximum burning time of all connected blocks. Chibi

First obtain the convex hull, and then rotate the card shell to output the square beauty contest of the farthest point. Time limit:3000 Ms   Memory limit:65536 K Total submissions:24459   Accepted:7467

Faulhaber's Triangle Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 124 accepted submission (s): 55Problem descriptionthe sum of the MTH powers of the First n IntegersS (n, m) = sum (j = 1 to n)

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4570 Question meaning: N count You can divide it into multiple segments. The length of each segment cannot exceed 20. Yes, sum (ai * (2 ^ Bi) is the smallest. AI is the first

Count the trees Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 1255 accepted submission (s): 818 Problem descriptionanother common social inability is known as ACM (abnormally compulsive

Question address: http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 1475 Question meaning: Give you a sequence to tell you the definition of the wavio sequence. If the length of a

You can determine whether binary enumeration is feasible during common working hours. Body check Time limit:1 second Memory limit:32768 KB Special Judge due to the spread of H1N1 all over

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1686 Question meaning: For two strings, calculate the number of repetitions of the first string in the second string, which can overlap. Solution: Directly use KMP. If a match

Address: A. cakeminator B. Road Construction C.Purification They are all thinking questions, and they have to practice a lot. A. cakeminator /* The question is complicated. You can eat each row or column with something, at least one cake can be

IT companies Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 290 accepted submission (s): 85Problem descriptionthere are n IT companies which are labeled from 1 to n. each of them has a branch (a

Previously, this problem was always done with the cost flow. Today I want to try the km. As a result, the previous km template was stuck. N ^ 4 is originally .... Make a decisive change. After all, I only used question a for that template .....

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4447 Question meaning: Obtain the simplest polynomial of x ^ n-1. Solution: Official solution report: Manual or written brute-force programs calculate less N, and we can see that

At the beginning, I used LCT to query and, and then I got down to my knees .... In the future, it will be better to use rmqlca without modifying the graph structure (in fact, I still forget to split tree links, but the query time is really too

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3613 Question meaning: Give you a string, S, and then tell you the value of each letter Let you divide s into two substrings. If the substrings are input strings, the value equals to

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3486 Question meaning: Given the sequence of N numbers, let's look for the sum of the maximum values of the first K intervals. The length of each interval is N/K. If the remaining