C++

PictureTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 12879 Accepted Submission (s): 6698   Problem DescriptionGive you the width and height of the rectangle, darw it. InputInput contains a

This question took nearly an hour, and some situations such as incorrect thinking and out-of-the-boundary occurred successively. After various processing, the AC finally Start with the formula -- Cos (nA + mB) = cos (nA) cos (mB)-sin (nA) sin

Simple dp Sort weights by quality Only items that may be adjacent to their quality can obtain the Least Square of the Quality Difference Dp [I] [j] indicates the minimum fatigue required by j pairs in the first I items Dp equation: dp [I] [j] = min (

The simple Floyd algorithm is used. In the initial phase, map is set to 1 on the diagonal line. After processing with the floyd algorithm, you only need to check whether there is more than 1 on the diagonal line. If yes, you get (* ^__ ^ *)! #

Expand the T string to two times, and KMP should note that the T length must be greater than the P length.  # Include # include # include # include using namespace std; char P [400005]; char T [400005]; int f [400005]; void getfail () {int m =

/* Bfs + the key to finding the tree diameter: if k # include # include # include # include # include # include # include using namespace std; typedef long ll; // typedef _ int64 int64; const int maxn = 100005; const int inf = 0x7fffffff;

Enter the plus or minus formula for positive integers less than 100 on the keyboard. Write a program to output the computation result string.The format of the input string is "operand 1 operator operand 2", and "operand" and "operator" are separated

Analyze the problem and consider the known data structure. Details are very important. # Include # include # include # include # include using namespace std; // If an array is marked, it is incorrect. For example, for example, 3 1 2 5 4, after

There are a total of n rounds of walk, each time can be left to the right or do not move. Expect to reach the rightmost end   # Include # include # include # include using namespace std; double l, r, m; int n; double dp [103] [222] [222]; void

Enumerate each edge , ans = (val [u] + val [v])/(prim-g [u] [v]); Prim is the smallest sum of values in the Spanning Tree that contains the edge . First, find the Minimum Spanning Tree of the source image. When use [u] [v] = 2, the edge exists on

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 problem, And the status can be compressed to dp. Dp [I] [j]

Problem DescriptionThere is a cycle with its center on the origin.Now give you a point on the cycle, you are to find out the other two points on it, to maximize the sum of the distance between each otherYou may assume that the radius of the cycle

StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission (s): 695 Accepted Submission (s): 254   Problem DescriptionGiven 3 strings A, B, C, find the longest string D which satisfy the following rules:A)

During the competition, due to the incomplete Consideration of the previous algorithm, the competition was completed quickly, but after a long time of tangle, as I wrote in the original method, I had to open multiple arrays for various judgments,

As a teacher of a kindergarten, you have has things to do during a day, one of which is to allot candies to all children in your class. today you have N candies for the coming M children. each child likes different candy, and as a teacher who know

Question: Find the child string with the most repeat times in a string that can be obtained by repeat. If multiple duplicates are the same, the smallest Lexicographic Order is output. Solution: It's similar to the paper. I haven't understood it for

  Question: enter a vertex on a convex bag (the vertex inside the convex bag is not, either a convex bag vertex or a dot on the convex bag side) to check whether the convex bag is stable. Stability It is determined whether the convex hull can be

The prime factor decomposition of numbers ..   Code:    #include #include #include #include using namespace std; typedef long long LL; int main() { LL n, p, t, i; int pri[100], e[100]; while (true) { cin >> p; n =

This question is hard to come up with on the network stream... Increase the arc with a capacity of 1 from s to each item to Bob, and then increase the arc with a capacity of 1 from each item to t (representing the number of types ). When running the

Meaning: There are n regions, and each region has some gold mines. Mining a gold mine requires a certain amount of money and may produce a certain amount of profit. If you want to open a gold mine, all the gold mines above this gold mine must be