C++

  Question: Click to open the link   ThemeGive you a n-point m-side undirected acyclic graph, light on as few nodes as possible, so that all sides are illuminated. Each light will illuminate all edges with it as an endpoint. When the total number of

It is a very difficult question, but it takes a lot of effort to process the space between the two rows. In the end, char is used, because it can be modified freely. Compared with the string, the insert function is more flexible. You can also use

Continuous Maximum ProductTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission (s): 813 Accepted Submission (s): 305 Problem DescriptionTom and his good friend Tom are playing a game. The computer randomly

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 20489 Accepted Submission (s): 9159   Problem DescriptionA ring is compose of n circles as shown in digoal. put natural number 1,

A undirected connected graph with n vertices and m edges. At the beginning, node 1 caught fire and it took one day for the fire to spread to its adjacent vertex. At the beginning, a robot was also located at Node 1, however, when the robot leaves,

Question: Divide n friends into m groups. Find the minimum number of people in each group ,,, The maximum stream + two points, and isap run quite fast ,,,         # Include # include const int n= 1510; const int inf = 0x3fffffff; int dis [N], gap [

Recently, I have been practicing the digital dp. This is still a problem of wang. This is a basic question. I have nothing to say. I have attached the code.   # Include # include # define LL unsigned long longLL dp [3] [30]; LL a [30]; void init

Give n circles and m triangles, and make sure they do not intersect each other. Use a fence to enclose them and find the shortest perimeter. Solution 1: Take 2000 points evenly on each circle, and find the circumference of the convex hull to allow

Time Limit: 1000 MS Memory Limit: 30000 KTotal Submissions: 9795 Accepted: 6406 Description Consider the natural numbers from 1 to N. by associating to each number a sign (+ or-) and calculating the value of this expression we obtain a sum S. the

Special equationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 206 Accepted Submission (s): 108Special Judge Problem DescriptionLet f (x) = anxn +... + a1x + a0, in which ai (0   InputThe first

Knowledge 1: Ferma's theorem is an important theorem in number theory. The content of this theorem is: if p is a prime number and (a, p) = 1, then a ^ (p-1) 1_1 (mod p) if p is a prime number and a and p are mutually qualitative, then the remainder

#include #include #include #include #include #include using namespace std; const int N = 5e4+10; const int K = 32; typedef long long LL; struct edge_t { int v, to; }; vector E; int L[N]; void init(int n) { E.clear();

// File Name: hdu1754.cpp // Author: bo_jwolf // Created Time: friday, August 16, 2013 # include # include # include # include # include # include # include # include # include # include # include # include # include # include #

PalindromeTime Limit: 3000 MS Memory Limit: 65536 KTotal Submissions: 48269 Accepted: 16570 Description A palindrome is a regular rical string, that is, a string read identically from left to right as well as from right to left. you are to write a

Enter three integers, n, m, and k, indicating that there is a map with n rows and m columns next. A robot enters from column k of the first line. Ask how many steps the robot can take. If a loop occurs The number of steps in the output

I haven't posted a post for a long time. Now I want to write down my efforts last night and this morning. I copied the description of the question directly: ExponentiationTime Limit: 500 MS Memory Limit: 10000 KTotal Submissions: 121122 Accepted: 295

// File Name: wiki1282.cpp // Author: bo_jwolf // Created Time:, Saturday, August 17, 2013 # include # include # include # include # include # include # include # include # include # include # include # include # include # include #

Question: There are N products with names consisting of lower-case letters and M inquiries. Each inquiry comes with a K and then a K bar code. Each bar code represents one lower-case letter, these K bar codes are connected into consecutive K letters

Maximum Sum   BackgroundA problem that is simple to solve in one dimension is often much more difficult to solve in more than one dimension. consider satisfying a boolean expression in conjunctive normal form in which each conjunct consists of

Question: There is a spanning tree with the length of each side being 1 The terrorists blow up one of the sides and divide them into two parts. Get the larger diameter in the diameter of the temp two-digit multiplied by the weight of this edge. Find