Others

Question link: Http://poj.org/problem? Id = 1080 Question: For two strings consisting of four characters: A, C, T, and G, you can add-to the two strings so that the two strings are of the same length. Each two-character match has a value.

Question link: Http://poj.org/problem? Id = 2096 Question meaning: OneProgramThere are s subsystems, and N bugs need to be found. One person finds one of N bugs a day and finds the expected number of days for finding n bugs and having bugs

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4565 Question: Value. Solution: Because (A-1) ^ 2 Then construct a recursive relationship. Sn * (a + SQRT (B) + A-SQRT (B) = S (n + 1) + (a ^ 2-b) * s (n-1) So S (n + 1) =

A windmill animation works as follows: A two-dimenstmset of points, no three of which lie on a line is chosen. then one of the points is chosen (as the first vertex) and a line is drawn through the chosen point at some initial angle. the animation

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3533 Question: Give a Matrix box of M * n with K cannons. Each cannon uses T as the cycle to launch shells in the c direction. The shell speed is v. Calculate the shortest time

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4570 Question meaning: The meaning of the conversion is to give n numbers, and find a Division so that the first number of each segment is multiplied by the sum of the power and

Question link: Http://poj.org/problem? Id = 1037 Question: Give N and obtain 1 ~ N is the M sequence in the Lexicographic Order. Solution: Classic DP + count. In the previous example, only all types of data are required, but now the M

Question link: Http://poj.org/problem? Id = 1019 Question: SK indicates 123... K Arrange s1s2s3... Sk in a row such as 112123123412345123456 .... Calculate the number I. Solution: If SK represents the number of digits occupied by 123 ..

Two Regular Expression Libraries are used: qregexp, PCRE, and PCRE ++. Regular Expressions are generally used in writing, but for greedy matching, different Regular Expression Libraries are somewhat different.In PCRE, the non-Greedy mode is caused '?

Ignatius and the princess I Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 9433 accepted submission (s): 2784Special Judge Problem descriptionthe princess has been abducted by the Beelzebub

Bombs Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others) Total submission (s): 326 accepted submission (s): 45 Problem description terrorists are around und everywhere, they always make troubles by detonating bombs. the

Islands and bridges Time limit:4000 Ms   Memory limit:65536 K Total submissions:7970   Accepted:2055 DescriptionGiven a map of islands and bridges that

Statistical difficulties Time Limit: 4000/2000 MS (Java/others) memory limit: 131070/65535 K (Java/Others) Total submission (s): 13884 accepted submission (s): 5971 problem descriptionignatius recently encountered a problem where the teacher gave

Victory (continued) Time Limit: 4000/2000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 4057 accepted submission (s): 1342 problem descriptionignatius was taken away by the devil again (I don't know why he liked it

There are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is highly challenging. That’s why we call it “Yet Another Multiple Problem”. In this problem, you're asked to solve the following

The Ghost Blows light Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1606 accepted submission (s): 490Problem descriptionmy name is Hu Bayi, robing an existing ent tomb in Tibet. the tomb

Where a, B, n, m are positive integers. percent x percent is the ceil of X. For example, limit 3.14 percent = 4. You are to calculate Sn. You, a top coder, say: so easy!   Input there are several test cases, each test case in one line contains four

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4433 Question: Give two equal-length numeric strings S1 and S2. Each operation can add up to three consecutive steps + 1 or-1. If 9 is exceeded, it is changed to 0. If it is less than 0,

Alice and Bob's game never ends. today, they introduce a new game. in this game, both of them have n Different rectangular cards respectively. alice wants to use his cards to cover Bob's. the card a can cover the card B if the height of A is not

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4568 Question: Give a matrix N * m (n m There are K (k Solution: Dij pre-processes the minimum cost of each jewelry to other jewelry, excluding its own cost. Then there is the bare TSP