C++

Idea: Mathematics + tabulationAnalysis:1. The traditional Joseph question is given n people and m. The current person is kicked out every m times and the number of the person left behind2. The first k are good people, and the last k are bad people.

Factstone BenchmarkAmtel has announced that it will release a 128-bit computer chip by 2010, a 256-bit computer by 2020, and so on, continuing its strategy of doubling the word-size every ten years. (Amtel released a 64-bit computer in 2000, a

1) list. h   /** List_2.cpp ** Created on: August 2, 2013 * Author: Huang Dongdong * constantly strives to have a girlfriend like Zhang Zetian ...... */# Include using namespace std; typedef int T; class List {struct Node {T data; Node * next; Node

Question meaning: Give an n * n matrix with m obstacles. Ask how many points can be placed on the border that is not a corner so that all points can be moved to the opposite side at the same time, do not encounter obstacles and conflict with each

N-knife cutting board The following figure shows the 8x8 chessboard. Each number represents the weight of the corresponding vertex of the chessboard. After n knives are cut, the minimum mean variance of the sum of each shard is The formula for the

// TIM3 frequency division # defineTIM3_DIV1 (1-1) # defineTIM3_DIV18 (18-1) # defineTIM3_DIV72 (72-1) //*************************************/ /function name: TIM3_NVIC_Configuration // Description: TIM3 interrupt priority configuration // input:

For an integer array a [], find the subset that contains the maximum number of consecutive numbers, for example, 15, 7, 12, 6, 14, 13, 9, 11, then return: 5: [11, 12, 13, 14, 15]. The simplest method is sort and scan it again, but it requires o

In my education, recursion seems a mysterious thing. It is hard to say clearly, it is a senior product, like a fog. In the course of my high school study, I didn't understand what recursion was at first. The teacher may think that we are hard to

The structure of a grayscale image consists of four parts: File Header, BMP Information header, color palette, and BMP data content. The gray-scale palette has a total of 256 RGBQUAD structures and stores the gray-scale values ranging from 0 to 255.

Obtain the longest Lexicographic Order required by the common subsequence Enumerate all substrings In the first string and then perform KMP on each string. Find the target substring I have learned how to use the strncpy function.   # Include #

# DefineADC1_Chanel00 # defineADC1_Chanel11 # defineADC1_Chanel22 # defineADC1_Chanel33 # region // = the number of open AD channels ============================#defineadc _ ENB_NUM1 # define ADC_CYC_Cycles5 ready // set the adconversion rate uint16_

Question: Give you a big wave of points in the lower left corner of the square and the length of its side. It's actually points. Then obtain the square of the distance between the two points on the plane. Questions about rotating card shell

RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 8096 Accepted Submission (s): 3063   Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the

A matrix. Some grids are F and some are R. You need to find the largest sub-matrix so that all the matrices are F. Idea: enumerate each sub-Matrix directly, obviously the complexity is O (m ^ 3 n ^ 3), obviously TLE. We can use scanning method: up

N m indicates n nodes and m edges. The m row a B indicates that a-B has a directed edge. Question: Given a directed graph, after deleting a vertex, you can find the maximum number of points in the strongly connected component of the graph. Q: What

#include #include #include #include using namespace std;#define N 20010int s[N], f[N], n, root;vector g[N];void getroot(int now, int fa) { int u; s[now] = 1; f[now] = 0; for (int i=0; i  

Problem C: Vito's family   BackgroundThe world-known gangster Vito Deadstone is moving to New York. he has a very big family there, all of them living in Lamafia Avenue. since he will visit all his relatives very often, he is trying to find a house

Time Limit (Common/Java): 1000 MS/3000 MS Memory Limit: 65536 KByteTotal Submit: 57 Accepted: 23Description Mirko received ed a message from his friend Slavko. slavko, being a world class cryptologist, likes to encrypt messages he sends to Mirko.

M indicates m seconds. The following line indicates n lamps (the lamps are arranged in a ring, that is, the head and end are connected) The light is highlighted by 1 0. For any lamp, when the light on the left is on, the light changes the status in

There are two rabbits, one in the upper left corner and the other in the upper right corner. The two rabbits have their own moving speed (hourly) and their initial moving direction. Now there are three possible reasons for them to turn: hitting the