C++

Original question:This is year 2200AD. science has progressed a lot in two hundred years. two hundred years is mentioned here because this problem is being sent back to 2000AD with the help of time machine. now it is possible to establish direct

Question:The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21,121 1, 111221 ,... 1 is read off as "one 1" or 11.11 is read off as "two 1 s" or 21.21 is read off as "one 2, then one 1" or 1211.Given an integer n,

Give three strings and ask if the third string can be composed of the first two strings ..Dfs + pruning ..[Cpp]# Include # Include # Include # Include Using namespace std; Const int maxn = 210;Char sa [maxn], sb [maxn], p [maxn // Int dp [maxn]

The longest common substring of multiple strings and the smallest Lexicographic Order is output. Question: suffix array, two answers. [Cpp]# Include # Include # Include # Include # Include # Include # Include # Include # Include # Include # Include

Description: Calculate a minimum binary number of S for the three numbers (the data size is quite large) of the ABC, and the value contains the binary string of P (for example, if P is 101, 1101 meets the requirements ), and A ----------------------

Description:There are n rectangles. Each rectangle can be described by a and B to indicate length and width. Rectangle X (a, B) can be nested in Rectangle Y (c, d) When and only when a InputThe first line is a positive number N (0 The first row of

StripesTime Limit: 1000 MSMemory Limit: 30000KBTotal Submit: 71 Accepted: 31Description Stripes is a two player game. necessary requisites are a board and rectangular stripes in three colours: red, green and blue. all the red stripes have dimensions

This question can also be done using the line segment tree and RMQ. Of course, RMQ is much faster than line tree. [Cpp]# Include # Include # Include # Include # Include # Include # Include # Include # Include # Define eps 1e-5# Define maxn111111#

I always remember that in C language, struct values cannot be directly assigned. I asked three students that they can be used in C ++, but not in C. They need to assign values to members one by one or use the memcpy function.I tested the following

2012 Multi-University Training Contest 8The More The BetterTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 1474 Accepted Submission (s): 368 Problem DescriptionGiven an sequence of numbers {X1, X2

Poco: ThreadPool provides the thread pool function to reduce the overhead of thread creation and destruction, and is suitable for applications on servers. When creating a thread pool, specify the minimum number of running threads and the maximum

Euclid's GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 893 Accepted Submission (s): 419 Problem DescriptionTwo players, Stan and Ollie, play, starting with two natural numbers. stan, the

Question 7 How to determine whether two linked lists meet each otherThe head pointers of two one-way linked lists, such as h1 and h2, are given to determine whether the two linked lists are intersecting.To simplify the problem, we assume that the

[Cpp]# Include  Void swap (int * a, int * B){* A = * a ^ * B;* B = * a ^ * B;* A = * a ^ * B;}; Void selectionSort (int * a, int n){Int min;Int minIdx; For (int I = 0; I {Min = a [I];MinIdx = I;For (int j = I + 1; j {If (a [j] {Min = a [j];MinIdx =

Given the number of n and the number of a target, can we find an expression to make the final result of the n count equal to the target value? Note that all operations here have the same priority, from left to right. Solution: 1: Train of Thought:

Description It is very hard to wash and especially to dry clothes in winter. but Jane is a very smart girl. she is not afraid of this boring process. jane has decided to use a radiator to make drying faster. but the radiator is small, so it can hold

This should be ZOJ's water question! It is A pity that the map in STL was used during the competition, but map was useless because it was not familiar with the map, so this question was not lost during the competition. You have time to learn and

From yesterday to today, I made four simple questions. A new page is enabled. Milk: It's easy and greedy. Select a cheaper price first. Code: [Cpp]/*ID: duanjia2PROG: milkLANG: C ++*/ # Include # Include # Include Using namespace std;Struct node{Int

I. Lab requirements Binary tree traversal is the basis for many other operations in the tree structure. This experiment aims to help students further understand the features of binary tree traversal in ascending, central, and descending order, and

(1) Callback MethodThe essence of Callback is to set a function pointer and call this method when an event needs to be triggered. For example, Windows's window message processing function is of this type. For example, in the following sample code,