Others

Description: calculates the longest input string length # include # include # include int N, sum; char STR [1010]; int V [1010] [1010]; int max (int x, int y) {return x> Y? X: Y;} int dp (int x, int y) {If (V [x] [Y]) return V [x] [Y]; if (x = y)

Description: I didn't understand the question at the beginning. I used to generate a number (x, y ), make x ^ 2 + y ^ 2 = s ^ 2 # include # include int V [310] [310], arr [45] [2]; int pow_two (int x, int y) {return x * x + y * Y;} int main () {//

Description: The question refers to a change in the number between 0 and n so that no sub-sequence can appear in an equidifference sequence, either 1 2 or 4 3, because 1, 2, 3, and 4, can be used to output any of them, the recursive merge method is

Description: it timed out directly at the beginning, and then changed a bit. It actually went through # include # include # define N 10010 double num [N] [2]; int main () {// freopen ("a.txt", "r", stdin); int n; while (scanf ("% d", & n )! = EOF)

Calculate the number of Fibonacci numbers in the range [a, B]. Because the maximum is 100 to the power of 10, the first recursion is about 100 to the power of 10, which can reach about 480th of the Fibonacci series, therefore, use the brute force

For a2 + b2 = c2, obtain all the three tuples (a, B, c) that meet the conditions, and output a, B, c. The number of three mutual groups and all of them from 1 to N.The number of numbers that have not been seen in the productkey, devicename, and

There are s satellites, and the rest are all wireless devices (finding the maximum distance between the two radios in the remaining radio points ), the actual result is to find the length of the edge with the maximum P-S Value in the minimal

For more information about the Topology Sorting of purebred objects, see the code in Liu rujia's getting started classic ~ The Code is as follows: For more information about the Topology Sorting of purebred objects, see the code in Liu rujia's

Based on the question, the number of seconds between the two floors that each elevator can reach is the weight of each edge to construct an undirected graph. Then use Dijkstra to find the shortest time. Note that each change to the elevator needs to

I thought it was a relatively simple question. The result was that I understood the incorrect question. I thought that the question was an adjacent three numbers and the result was wa, after reading other people's code, we can see that the question

Greedy: starting from the first given string, each time the string with the largest matching prefix of the previous string is selected as the next string, and so on. The Code is as follows: # Include # include # include # include # include #

Basic Idea: if the target line segment is known to be [0, m], select the point with the largest value corresponding to the right endpoint from all the lines with the given left endpoint value less than the left endpoint value of the target line

Greedy, the original greedy method was to find every resident with a positive demand and search for the residents with a negative demand on both sides, it is not difficult to weigh the demand and sales volume to reduce one of them to zero. if the

There are two optimal ways to solve the greedy problem. One is the combination of the smallest walk and the largest walk, and the other is the combination of the smallest and largest walk, certain conditions are required ~The following two data

Greedy, as long as each step ensures that the cost of B is less than or equal to the cost of A, B will always be used; otherwise, solution A will be used to end, the only thing worth noting is that when B's solution is halved, the value of N cannot

Binary Number Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission (s): 472 Accepted Submission (s): 313Problem DescriptionFor 2 non-negative integers x and y, f (x, y) is defined as the number of

The question, connectivity, and degree of the pure Euler loop. Note the handling of special cases when r = 0 (this should be Not Possible )~ The Code is as follows: #include#include#include#includeint p[200+5];int find(int x){ return p[x] == x ?

Longest Common subsequence. The Code is as follows: #include #include #include #include using namespace std;#define Maxn 102int main(){#ifdef test freopen("input.txt", "r", stdin);#endif int dp[Maxn][Maxn]; int len1, len2, cct = 0; char

This question is really a shame. WA has done it three times and there is no check error. If someone else looks at it, it will be "S-Tree #1, it should be 1, 2, 3 ..., as a result, "S-Tree #1:" was directly pasted at the time of writing, and no data

As long as the quality at the node is not 0, there will be a subtree, recursively completing all input ~ The Code is as follows: As long as the quality at the node is not 0, there will be a subtree from the very beginning, recursively complete all