Others

  Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 233   Question meaning: For two four-tree trees, each layer has a value. If one is black, the value is black.

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1226 Question meaning: Give N, give NN a JJ number, ask the minimum number of less than 500 digits composed of these numbers JJ number is a positive integer multiple of the decimal

  Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 1592   Question meaning: For a string composed of-and O, you can change "-oo" to "-- O", and "Oo-" to "-- O ",

  Question link: Http://acmpj.zstu.edu.cn/JudgeOnline/showproblem? Problem_id = 3897   Question meaning: Output a matrix of N * M. Rule: Input 1-N * m elements in sequence in the back-type mode, first from left to right, then from top to

  Question link:Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1715 Returns the Fibonacci sequence.   # Include # include # include # include # include # include # include # include # include # define EPS 1e-6 # define Inf (1 = 1) {

  Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 1093   Question meaning: There are n turtles, one on the other, telling the initial arrangement of turtles, and

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3746 Question meaning: Given a string, you can find at least a few characters at the beginning or end to make the entire string a periodic string, and the number of cycles is

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4468 Question meaning: Give you a string R, find a string S, and make the prefix of S 1 + S 2 + S 3 +... + S n + S = R. Solution: KMP + greedy. Initially, R [1] is assigned

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1711 Question meaning: Locate the starting position of B in A. If not, it is-1. Solution: Bare KMP, not to mention Don't KMP, You can see

I hate it Time Limit: 9000/3000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 27434 accepted submission (s): 10889Problem description many schools have a popular habit. Teachers like to ask, from xx to xx, what is

In a competition, the winner is scored 3 points and 0 points within the specified time period. In addition, the winner is scored 2 points and the winner is scored 1 point. Then the League is a single round-robin (compared to any two teams), giving

Mad veterinarian Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 168 accepted submission (s): 58Special JudgeProblem descriptionMad veterinarianPuzzles have a mad veterinarian, WHO has developed

Please stamp the question here Determine whether the minimum spanning tree is unique Question Analysis: Calculate the next generation tree and determine whether it is equal to the minimum generated tree weight. How to calculate the secondary

Time: 2013.08.14 Today, we have completed the private and STD login code in the contest mode. 1. Private permission Competitions When Logging On, you must enter the password set for the game. The Code involved here is

Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4514 Question meaning: Give you a picture to determine whether the graph has a ring. If there is no ring, find the longest path. Solution: Use DFS to determine whether a ring exists, and

Question link: Http://poj.org/problem? Id = 2411 Question meaning: Fill in a rectangle area of N * m with a rectangle of 1*2 and 2*1. Solution: You can use a contour line. For each grid, enumerate the status of the previous grid to obtain all the

  Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 69   Question meaning: There are a total of n persons numbered 1-N, standing in a circle. The two civil servants start

Question link: Http://codeforces.com/problemset/problem/258/ B Question meaning: I will give you an M (M Solution: Use the digit DP to obtain the number of numbers containing 0 4 or 7, and the number of numbers containing 1 4 or 7, including

  Question link: Http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 2052   Question meaning: As the problem statement is too long, I haven't read the problem statement completely during the

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