C++

ReversiTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission (s): 1047 Accepted Submission (s): 430 Problem DescriptionReversi, also called Othello, is a two-sided game.Each of the two sides corresponds to

I want to practice the use of stack. In this question, the longest number of villages connected to x can be divided into two parts, the longest continuous sequence from 1 to the right of the X-1, the longest continuous sequence from x to the left of

Shengli Great EscapeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 21449 Accepted Submission (s): 8442   Problem DescriptionIgnatius was taken away by the devil. One day the devil went on a

I believe everyone knows the concepts of big-end storage and small-end storage. We generally don't need to consider them at ordinary times. However, in some cases, these concepts are very important. For example, during Socket communication, our

Question: The 1X2 bone card covers the plane. The input ensures that the horizontal bone cards (n) do not overlap, and the vertical bone cards (m) do not overlap, but the horizontal and vertical parts may overlap, ask how many dominoes do not

1. Introduction to map Map is an associated container. It features that adding or deleting nodes has little impact on the iterator, except that the Operation node has no impact on other nodes. For the iterator, you can modify the real value instead

The question requires the sum of the shortest distance from the origin to all vertices and the shortest distance from all vertices to the origin. When finding the shortest distance from all vertices to the origin, a technique is used to reverse the

Binary Tree is a very important data structure. Many other data structures have evolved based on binary trees. For binary trees, there are three traversal methods: Forward, middle, and backward. Because the tree definition itself is a recursive

Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. he thinks

After reading the report, the idea is the same. I just need to paste it. After adding an edge, the graph can be divided into two parts X and Y. Only the side from X to Y has no edge from Y to X, so we need to make the number of sides as much as

This question is exactly the same as HDU3874. HDU3874 solution report Of course, the data is enhanced. The only difference is that each value is 10 ^ 9, so we need to discretization and directly implement STL. Then the process below will be exactly

Problem DescriptionThe doggie found a bone in an internal ent maze, which fascinated him a lot. however, when he picked it up, the maze began to shake, and the doggie cocould feel the ground sinking. he realized that the bone was a trap, and he

  It is a mountain called the Hongshan village. It is said that the nickname of Hong Xiuquan's concubine was this!   The mountains are full of wild fruits (Delicious )! I haven't climbed up for a long time! # Include # Include # Deprecision MAX 10000

QuestionThere are n warehouses for m to look. One warehouse can only be managed by one person, and one person can manage multiple warehouses. Each person has a capacity pi. If he takes care of k warehouses, the security value of each warehouse is pi/

Question: Here are N groups of balloons. Each group has 2 balloons. Each group has a balloon. If N balloons do not meet each other, the maximum radius of the balloon is R. Idea: directly bind the radius to 2-sat to determine the feasibility. If

Question: I will give you a directed graph and ask you how many sides you can add so that the graph is still not strongly connected. Practice: 1. Find all strongly connected components in the graph. 2. Scale the above strongly connected component

[Cpp]Create base class base Create base class base [cpp]# Ifndef _ base_h# Define _ base_hClass base{Public:Base (int a, int B );~ Base ();Public:Int m;Int n;};# Endif # Ifndef _ base_h# Define _ base_hClass base{Public:Base (int a, int B );~ Base ()

Problem DescriptionGive you n points, m undirected edges, each side has a length d and a cost p, give you a start point s end point t, it is required to output the shortest distance from the start point to the end point and its cost. If the shortest

During the first small competition, I couldn't even understand the question. Later I heard the teacher explain it and understood the question, but I still couldn't! Success !!! #￥ # ￥ # % ￥ % ...... ￥ % ...... &...... & * () & * (% ...... & Amp; % ￥

Drainage DitchesHal BurchTime Limit 1000 MSMemory Limit 65536 kbDescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the cloverIs covered by water for awhile and takes quite a long