C++

/* This is an enumeration search of the radius and height, however, pruning is required */# include # include # include # include using namespace std; int n, m, minv [21], mins [21], best; void dfs (int M, int v, int s, int r, int h) {int I, j,

Obtain the longest Lexicographic Order required by the common subsequence Enumerate all substrings In the first string and then perform KMP on each string. Find the target substring I have learned how to use the strncpy function.   # Include #

Maze ProblemsTime Limit: 1000 MS Memory Limit: 65536 KTotal Submissions: 6322 Accepted: 3673 Description Define a two-dimensional array: Int maze [5] [5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, };It represents

There are n lawns, some cows graze on the grass, there are m roads between the lawns, and some lawns have shelter from rain. Each shelter is limited, the minimum time required to allow all cows to enter a rain shelter is given through each

The value is 1 ~ The number of 6 stones. Ask if you can divide the values of these stones equally...   Solution: Multiple backpacks 1) A typical description of multiple backpacks is as follows: n items are provided, and the size of the backpack is V.

From 1 to n and then to 1, each side can only walk once, seeking the shortest distance. Graph creation: each side can only go once, that is, the traffic is 1, the source point is added to connect with 1, the capacity is 2, the cost is 0, the

/* For the current user, if mat [n] [m] = 0 after completing his/her operations, the current user is the winner. Because if mat does not exist in other positions, you must win. If mat exists, let the next position reverse the one. */# include #

Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 10006 Accepted Submission (s): 3004Special Judge Problem DescriptionThe Princess has been abducted by the BEelzebub feng5

Problem DescriptionA wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub-string "13" and can be divided by 13. for example, 130 and 2613 are wqb-numbers, but 143 and 2639 are not. your task is to

/* 2-sat question: Given a circle, some vertices on the circle. Line 2.1. Some lines are provided. These lines can be connected in the circle or out of the circle. Is it possible that all lines are completely painted and do not overlap. Idea: draw a

# Include # include # include # include # include # include using namespace std; bool isShorter (const string & s1, const string & s2) {return s1.size () = 6;} string make_plural (size_t ctr, const string & word, const string & ending)

One of the first users of BIT's new supercomputer was Chip Diller. He extended his activation of powers of 3 to go from 0 to 333 and he got Ed taking various sums of those numbers. ''This supercomputer is great, ''remarked Chip. ''I only wish

Search, backtracking !!! A person's life cannot avoid making small mistakes !!! You can go back to mistakes! It cannot be wrong all the time !!! # Include # Include Int visit [10] [10];Char map [10] [10];Int n, ans, ss, t; Int judge (int x, int y){

When the time is not good, continue to water CF... A: Reconnaissance Enumeration   B: Borze Simulation   C: Flea Calculate the maximum number of locations, and then calculate the number of locations.   LL n , m , s;int main () { #ifndef

Question: Click to open the link   QuestionFor a tree with n nodes, the distance between any two nodes is the shortest Number of edges connecting two nodes.There is a "Demon book" at a node in the tree. This book will affect all nodes within it d.It

A. PuzzlesTime limit per test1 secondMemory limit per test256 megabytesInputstandard inputOutputstandard outputThe end of the school year is near and Ms. manana, the teacher, will soon have to say goodbye to a yet another class. she decided to

/* Prim: given some points, a satellite can connect two points, and there is a certain distance between points and points. Ask the minimum distance that can connect all points. */# Include # include # include # include # include # include #

/* Key game state: the larger number is more than 2 times the number of decimal places. */# Include # include # include # include # include # include # include # include # include # include using namespace std; typedef long int64; //

When the dfs value is returned, the return values of the two Nos are different. The wrong one is-100, and the other is-10. It is definitely incorrect !! Hey, you have found it, changed it, and submitted it! By the way !! %

Calculate the Geometric Convex Hull problem. Use the cross product to determine whether all vertices meet the same direction of p1 (x1, y1), p2 (x2, y2), p3 (x3, y3 ); based on (x1-x3) * (y2-y3)-(x2-x3) * (x1-y3 ); #include #include #include