C++

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

Cat continuous display, View File Content more Page View File Content less page control View File Content popular point: cat displays all the file content at a time, regardless of whether you can see clearly, after the cat command is displayed, it

Description A fractal is an object or quantity that displays self-similarity, in a somewhat technical sense, on all scales. the object need not exhibit exactly the same structure at all scales, but the same "type" of structures must appear on all

Question: Given a 2N * (2N + 1) map, there are some revolving doors on the map, at least how many doors need to be rotated, so that the map can pass through (1, 1) All vertices end to (1, 2N + 1 ). Question: Because the door is sparse, only the same

A diameter robot walks on an m * n lattice board and follows the go or turn command,Go indicates 1-3 meters per second,Turn refers to turning 90 degrees, taking one second, How many seconds does it take to start from the start point to the end point?

Use the template of Luo's great God to get the suffix array. # Include # include # include # include using namespace std; # define N 222222/***** suffix array template *****/# define F (x)/3 + (x) % 3 = 1? 0: tb) // F (x) To find the starting

/* 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){

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

Question: There is a tree, but the cost of dropping an edge is: Remove this edge and generate the maximum diameter of the two sides * the weight of this edge. The minimum cost is required for removing the edge. Output edge number. Practice:You can

A given n (18 ≤ n ≤ 10 ^ 12), an proportional Series k + k ^ 2 + ....... + k ^ r = n or = n-1, and obtain the smallest k * r. If the smallest is not unique, take the smaller r Analysis: There are two unknown numbers: r, k, obviously, r has only a

/* 64-bit operation !!! A 01 matrix is given. T queries. Each time you ask whether the specified small Matrix exists in the large matrix. (64-bit record status !!!) */# Include # include # include # include # include # include # include #

Problem DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E ). A spanning tree of G is a subgraph of G, say T = (V', e'), with the

Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. they will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. if the monkey is clever enough, it shall

Fluctuation sequence time limit: 1000 MS | memory limit: 65535 KB difficulty: 2 describes an integer sequence with a length of N, the number in the sequence is two or two different, now we need to find a fluctuating sequence in it. The longer the

Returns two strings x (lenth # Include # include # include using namespace std; const int N = 10005; const int M = 105; struct bign {int len, sex; int s [M]; bign () {this-> len = 1; this-> sex = 0; memset (s, 0, sizeof (s);} bign operator =

C ++ has two main ways to create a dynamic two-dimensional array: 1. use an array pointer to allocate a pointer array, store its first address in B, and then assign an array int ** B = new int * [row] to each element of the pointer array; //

Question: A string represents a four-character arithmetic expression, and the correct value of this expression must be calculated. Note: 1. The four arithmetic operations are addition, subtraction, multiplication, division, and "+-*/" 2. the number