Others

I know it can feel frustrating sometimes, and you might feel like some problems will always be difficult, but don't give up. it will get easier with time. if you keep practicing and solving problems, your abilities will improve (it can't be any

Time limit of the reverse logarithm: 1 second space limit: 65536 kb in one arrangement. If the front and back positions of a pair are in the opposite order of size, that is, the front number is greater than the back one, they are called a reverse

// Div2 A # include int main () {int I, j, N, T; scanf ("% d", & T); While (t --) {scanf ("% d ", & N); If (n> = 180 | n int X [100005]; int main () {// freopen ("input.txt", "r", stdin); int N, I; scanf ("% d ", & N); int sum = 0; for (I = 0; I =

# Include int main () {// freopen ("1.txt"," r ", stdin); int N, H, M, S, H1, M1, S1; scanf ("% d", & N); While (n --) {int H2 = 0, M2 = 0, S2 = 0; scanf ("% d: % d: % d ", & H, & M, & S, & H1, & M1, & S1); If (S> = S1) s2 = s-s1; else {M --; S2 =

Free pie Time Limit: 2000/1000 ms (Java/other) memory limit: 65536/32768 K (Java/other) Problem descriptionIt is said that the sky will not drop pies, but one day Gameboy is walking on the path home, suddenly there are a lot of pies in the sky.

Color the ball Time Limit: 9000/3000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 5851 accepted submission (s): 3116Problem descriptionn balloons are arranged in a row, numbered 1, 2, 3 .... n. given two integers

Binary Tree Traversals Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 2494 Accepted Submission (s): 1084Problem DescriptionA binary tree is a finite set of vertices that is either empty or

Shortest Path Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 8231 Accepted Submission (s): 2461Problem Description gives you n vertices, m undirected edges, and each edge has a length of d and a

What Are You Talking About Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission (s): 10424 Accepted Submission (s): 3320Problem DescriptionIgnatius is so lucky that he met a Martian yesterday. but he

Hat's Words Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 5772 Accepted Submission (s): 2154Problem DescriptionA hat's word is a word in the dictionary that is the concatenation of exactly two

Three-point sequential time limit: 1000 MS | memory limit: 65535 KB difficulty: 3 Description The coordinates of the three non-collocated vertices A, B, and C must be A triangle. Now let you determine the coordinates of A, B, is C

Prime Number summation problem time limit: 3000 MS | memory limit: 65535 KB difficulty: 2 Description Now you are given N numbers (0 Input The first line shows how many groups of test data the integer M (0 The

Potato time limit: 1000 MS | memory limit: 65535 KB difficulty: 4 Description Bean-eating is an interesting game, everyone owns an M * N matrix, which is filled with different qualities beans. meantime, there is only one bean in any 1*1

HDU-1166-enemy army arrays (tree array) Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1166 This question was previously made using a line segment tree, And now uses a tree Array Let's talk about the tree array first. As shown in C1 = a1 C2 = a1 +

Maximum continuous subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 15620 Accepted Submission (s): 6842The Problem Description is a sequence of {N1, N2,..., NK} Given K integers. Any

HDU-1160-FatMouse's Speed Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1160 Sort weights from small to large. The smaller the weight, the faster the speed. You can find the longest ascending subsequence. # Include # include # include

#includeint dir[4][2]= {{-1,0},{1,0},{0,-1},{0,1}};char jk[25];int flag[25][25];int num;void dfs(int x,int y){ int i,j,xx,yy; for(i=0; i

# Include char jk [55] [55]; int dir [4] [2] = {-}, {}, {0,-1 }, {0, 1 }}; int flag [55] [55]; int m, n; void dfs (int x, int y) {// note that it is too painful, m, n is the opposite of x and y. The rule is that the vertex and the vertex to be

The reason for selecting the decompressed version of Tomcat is that we can use multiple Tomcat servers, but some problems may occur in the configuration. We need to manually change the configuration. My Tomcat version is:

Humble Numbers Time Limit: 2000/1000 ms (Java/Other) Memory Limit: 65536/32768 K (Java/Other) Problem DescriptionA number whose only prime factors are 2, 3, 5 or 7 is called a humble number. the sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16,