Others

Statistical vowels Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 13671 accepted submission (s): 5806 The Problem description counts the number of times each vowel appears in a string. Input

Counting squares Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 405 accepted submission (s): 212 Problem descriptionyour input is a series of rectangles, one per line. each rectangle is

2 Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1438 accepted submission (s): 535 Problem descriptionray is also interested in numeric columns:Four cards can be used to list many different

Given n tasks, each task has a completion time. These tasks are completed in four successive orders. Assume that the binary relationship is established between x and y:SAS: X starts at least at the start of Y.SAF: X starts at least when y is

Given many sticks, the two ends have different colors, and asked if there is such a combination to connect all the sticks to the beginning and end. Solution: this problem times out when using map to process strings, so I wrote a string hash for

Question: given a series of words, these words need to be connected in a way similar to an idiom, And now ask if such a passage exists. Solution: Why does this question always look like the Hamilton loop? The Euler Loop mainly solves the problem

Description Han has n sons: Han Yi, Han 'er... Han n. Thanks to Han's profound skills in acting skills and the close cooperation between them, the performances achieved great success, with a box office rate of up to 20 million. Zhouzi is a

This question seems to be an original question of poj... first, we can determine that if a line segment is included by another line segment, the left endpoint of the line segment containing it must be smaller than or equal to this line segment.

The content of a well-known data structure class. It is used to process the encoding. To be accurate, it can be decompressed. It is a lossless compression. It is used to make statistics on the given characters, then, a ing table of different lengths

DP [I] indicates the expected number of days for the I position to jump out. The positions n + 1 to n + 5 are constructed first, then assign all the six locations DP [N-N + 5] to 0, because these locations have gone out. Then there is recurrence. If

After offline processing, because the line segment tree cannot be dynamically expanded, all numbers are permanently labeled, regardless of information redundancy. For each node, the sum value of all the remainder values for 5 is retained and stored

Find new friends Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 2518 accepted submission (s): 1183Problem description the New Year is approaching. The pig Association is preparing to have a

Two relational matrices are given to indicate the mutual goodwill between the employer and the employee respectively. The sensitivity is 1 optimal, and N is the worst. If a person matches a person with a positive rating of P, the difference is a P-1,

Question: there is a system for determining the user level. Different levels have different evaluation criteria. The current level is required to be given for a user's historical level and the latest data. Solution: Map different levels of titles to

Question: A, B, and C are arranged in the remainder of the number N, which satisfies any I (a [I] + B [I]). % N = C [I]. For example, when n = 5, there is a following arrangement: A: 1 4 3 2 0B: 1 0 2 4 3C: 2 4 0 1 3 Solution: first, the arrangement

Given a hybrid graph, a hybrid graph has both one-way and two-way edges. Now, check whether such a graph has an Euler loop. Solution: first, let's review the condition of the Euler loop of the directed graph: the outbound degrees of all nodes are

Enumerate all cases, and each location may change or remain unchanged. complexity O (2 ^ 16 ).View code 1 /* 2 Author:Zhaofa Fang 3 Lang:C++ 4 */ 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 #include 12 #include 13

Two-dimensional cost backpack Problems There are two restrictions: the length of the movie and the number of parts of the movie. Note that DP [I] [0] = 0 is initialized, and the rest are unknown. Because the movie is a movie, the current Dp value

Http://acm.timus.ru/problem.aspx? Space = 1 & num = 1018 Question: There is an apple tree. The Apple Tree is a binary tree with N nodes in total. The tree node number is 1 ~ N, the node numbered 1 is the root of the tree, and the edge can be

Http://www.codeforces.com/contest/298/problem/D Alice has n fish and Bob has m fish. She has K varieties and the weight increases progressively according to the label. Can a's total weight exceed B's total weight. Practice: if each fish in a can