Others

M Fibonacci Series Time Limit: 3000/1000 MS (Java/others) memory limit: 65535/32768 K (Java/Others)Total submission (s): 993 accepted submission (s): 293Problem descriptionm Fibonacci Series F [N] is an integer series. Its definition is as follows:

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4485 Question meaning: Give a number in B-hexadecimal order to evaluate the value of this digital model (B-1. Solution: Because the given number is large, it cannot be done

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4487 Question:The start position is 0. Each step can be left or not moved to the right. After n steps are taken, the path can reach the rightmost expectation. Solution: During

(7) Main members of the set classSet is a collection container.☆Void clear (); // delete all elements ☆Size_type count (const key_type & X) const; // number of elements whose return key is X☆Bool empty () const; // whether the returned result is

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2128 Question meaning: In a matrix, a start point and an end point are given. Some of the matrices have walls and some have bombs. For a wall, it takes 1 s to take one step, it

Question link: Http://poj.org/problem? Id = 3897 Question meaning: Calculate the vertical scaling ratio so that the minimum distance from the start point to the end point is exactly equal to the given value. The horizontal and vertical step

Card collector Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others) Total submission (s): 1715 accepted submission (s): 786 Special Judge Problem descriptionin your childhood, do you crazy for collecting

Question link: Http://poj.org/problem? Id = 3895 Question meaning: Find a ring with the largest number of passing edges in the undirected connected graph. Solution: Direct DFS from any point without backtracking. Note that there are at least three

Comparison: Give a wire with N length and divide it into several parts, but each part must be similar. Pen counts Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 237 accepted submission (s):

(A * m ^ N) % P = (a % P) * (M % P) ^ n. in this case, M = p + 1, the remainder of each digit is a % P, and the remainder of the entire number is the sum of all the remainder and then the modulo .. A large number of templates have been knocked on

  Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 2175   Question meaning: For a string of characters, lowercase letters indicate the operands, and uppercase letters

During the first round of the competition, I have been engaged in this question, n, m, and K. The result is that both TLE and Wa are not successful. After analysis, the question is not as simple as you think. Question address: The bad number /*

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4528 Question meaning: To give you a matrix, '.' indicates that it can pass, and 'x' indicates that it cannot pass, telling you the position of S, D, and E. Ask if you can find D and E

Fiber Network Time limit:1000 ms   Memory limit:65536 K Total submissions:2741   Accepted:1262 DescriptionSeveral startup companies have decided to build a

Please stamp the question here [A, B] indicates that there are B-A + 1 kinds of gunpowder, and the power of gunpowder I is I. Now I want to use these gunpowder as a bomb, each time a bomb is made based on the Lexicographic Order of raw materials.

Cliff climbing Time limit: 10 seconds memory limit: 32768 KB At 17:00, Special Agent Jack starts to escape from the enemy camp. there is a cliff in between the camp and the nearest safety zone. jack has to

Crystal mine Time Limit: 5000/1500 MS (Java/others) memory limit: 32768/32768 K (Java/Others) Total submission (s): 528 accepted submission (s): 86 Problem descriptionlegends always begin with the sentence "long ago ......"Long long ago, there is a

Artillery positions Time limit:2000 ms   Memory limit:65536 K Total submissions:15275   Accepted:5749 DescriptionThe generals of the Headquarters intend to

Different digits Time Limit: 10000/4000 MS (Java/others) memory limit: 32768/32768 K (Java/Others) Total submission (s): 382 accepted submission (s): 90 problem descriptiongiven a positive integer N, your task is to find a positive integer m, which

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4471 Question meaning: Evaluate F (n ). When N is a special point NK Solution: When X is not a special point, use the basic matrix to quickly calculate the power of F [X]. when X is a