Others

Thought: multiply the result by 10 and the next result by the highest bit of the second number each time. Question Source: leetcode Class solution {public: // an integer multiplied by the number of digits string multonebit (string num, int data)

Bnustm7 subpalindromes String hash + line segment tree Question: Give a string ( 1) change the character at the specified position to C 2) ask whether the substring of L-R is a return string. Solution: The intervals maintain PL and PR,

There is a set of data about the arrival and departure time of the guests. Ask how many tables and chairs are required to meet the requirements of all the guests. Some people thought of the violence law at the beginning and thought that there was a

# Include # include # include using namespace STD; int n, m, next [10010], a [1000010], B [10010]; void getnext () {int I = 0, j =-1; next [0] =-1; while (I

What are the two types of trees? Question Link Given some vertices, ferma points (to which distance and shortest), output distance and Train of Thought: simulate annealing. The initial temperature is 1 W steps, and the cooling coefficient is set to

Give you two strings S1 and S2, and express them with the shortest string (Public String output once ). Sample Input Apple peachananas bananapear peach Sample output Appleachbananaspearch DP [I] [J]: the length of the first I of the first

There areNSMTP servers connected by network cables. Each ofMCables connects two computers and has a certain latency measured in milliseconds required to send an email message. What is the shortest time required to send a message from serverSTo

Question: The numbers of N people are from 1-N, and now they are unordered in a row. ID No. and ID-1 ID + 1 are friends, A group can be formed between friends. The value of a group is equal to the square of the number of people. Then there are m

Labels: Design Pattern Design Principles   The design pattern does not quickly improve your coding capability. The design pattern learning aims to avoid repeated coding and reduce labor volume. Learning the design pattern is of great benefit for

Description While processing his own farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is before you entered the wormhole!

// Merge a single-chain table // Merge linked lists// The two linked lists must be ordered.# Define maxsize 5Typedef int elemtype;Typedef struct linklist{Elemtype data;Struct linklist * next;} Linklist;// Create linked list 1Linklist * createlist1 ()

Description G Weird Advertisement Renat mullakhanov (REM), one of the most talented programmers in the world, passed away on March 11,201 1. this is very sad news for all of us. his team went to acm icpc world finals-2004, placed

The previous section describes how to apply PCA to 2D data. Now we use high-dimensional image data to try the effect. The original image 1 is shown. Figure 1 Each image is a 12*12 small patch, and the raw data is a 144*10000 matrix.X. After Using

Question Link Returns an integer N and returns all prime rings. Idea: solve the problem with backtracking. Note that an empty line is output between each two groups. #include #include #include #include using namespace std;const int MAXN = 105;int

Game Prediction Time limit:1000 ms   Memory limit:10000 K Total submissions:9552   Accepted:4566 DescriptionSuppose there are m people, including you, playing a special card game. at the beginning, each player has

Bnustm05 nested segments Discretization + line segment tree Interval Update You can also use discretization + set (or two-way linked list) # Include # include # include # include # include # include # include # include # include # include

Qin Shi Huang's national road system Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others) Total submission (s): 3395 accepted submission (s): 1189 Problem descriptionduring the Warring States Period of your ent China (476

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4932 Miaomiao's geometrytime limit: 2000/1000 MS (Java/others) memory limit: 65536/65536 K (Java/Others) Total submission (s): 410 accepted submission (s): 147 Problem descriptionthere

City planningproblem descriptionrecently Bob has ed a job. it's to reform the city's transport system. since the city has so has different ages, and the transportation network is so large that the government want to reduce the roads number. the

~~~~ The write discretization operation is discovered only when MLE is used. The other is the segment update of the Line Segment tree (each time you use different tags to update the interval). Finally, the number of tags in the statistics is