C++

Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. the University has a hierarchical structure of employees. it means that the supervisor relation forms a tree rooted at the rector V. e.

(1) binary search: The prerequisites for Binary Search are as follows: (1) a linear table must be ordered by key codes (usually from small to large ). (2) Secondly, linear tables must be stored in sequence. Therefore, the linked list cannot use

Give m words. A new word consisting of m words (two words can overlap) has a length of n and contains no less than k basic words. How many new words are there?   M is very small, and binary is used to indicate that a new word contains a basic

Digital dp, dp [I] [j] [k], I Represents three types of numbers: Class 1 indicates windy, Class 0 indicates the number of all current windy, and Class 0 indicates the number of windy starting with 0, but adding the leading zero is not the number of

Singleton mode:Make sure that only one object is generated when a class of the program is running, and you have the access permission to it similar to the Global object.   Mode Analysis:For example, when writing a program, we often have management

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.

This article was written as early as last year. However, because a part of my graduation thesis was directly referenced in this article at that time, I deleted the article for fear of re-checking. Here, upload the file and share it with you. Element

Idea: place the endpoints of all line segments and all intersections in an array, sort them in ascending order, and draw a vertical line from bottom to top for each x, We enumerate every two adjacent x and calculate the area between them separately.

Travel in timeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 971 Accepted Submission (s): 196   Problem DescriptionBob gets tired of playing games, leaves Alice, and travels to Changsha alone.

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

This is a tree built after data input in the example. 1 and 2 are the vertex of the added boundary, and numbers represent the node number. If we want to operate on a section of [l, r, you only need to rotate the number at the 1st bit to The 0th node,

These two questions are similar. I have done POJ for a long time, but I didn't think about it during the competition .. The question of POJ is that each of the N princes has a princess they like. When they select a princess to marry, the rest of

Check whether a tree has a point whose path length is K. POJ 1714 calculates the number of path entries with the path weight At the beginning, I thought that if K was found during the Sub-governance process, it would not be because the two nodes in

Question: 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. Practice: -- water over... Cut a circle evenly into 500 points, and then calculate the convex hull.

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

Total Submit: 53 Accepted: 14Description N points are placed in the coordinate plane.Write a program that calculates how many ways we can choose three points so that they form a right triangle with legs parallel to the coordinate axes.A right

Template (hdu1086) SPAN style = "FONT-SIZE: 18px"> include using namespace std; struct point {double x, y ;}; struct segment {point begin, end ;}; double min (double x, double y) {return x y? X: y;} bool onsegment (point pi, point pj, point pk) //

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

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

/* 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; //