Others

This question began to use the direct calculation method. Later, it was found that the direct calculation timed out and finally the table was selected. # Include int lucky [1000024]; void luck () // tables, otherwise timeout {int I, F; for (I = 1;

# Include # include int m, n, map [1024] [1024], des [1024], DIS [1024], DEP [1024]; int INF = 0x7fffffff; int Dijkstra (INT p) {dis [p] = 0; For (INT I = 1; I This question is easy to understand and wrong. At first, we failed to understand it

This is my second question. I did not expect a decisive tragedy. Finally, I had to go through the previous Code , I didn't expect that qsort had a problem. In the future, qsort will use question mark expressions instead of a-B. # Include #

KMPAlgorithmI am ashamed to write KMP for the first time. It hurts me to write KMP at getnext and KMP at the end. Changed n long # Include # include # define Max 1005 char STR [Max + 5] = {0}, CH [Max + 5] = {0}; int next [Max + 5], count = 0,

This question refers to changing the number to binary, and then starting from the number on the right, the first position is 1 N, and then the minimum number is 2*(N-1 ), at the beginning, I still want to use short division. But here I can use a &-a

If you think about this question carefully, you will know that the minimum number of times is that all the walls above the average height must be moved once. You just need to pay attention to the output format, sweat, and PE three times, I finally

This is a template question for getting started with tree arrays. It is very basic. It has become a "naked" entry question by Tom. Haha, A plus, and a sum are all done. # Include # include # define lowbit (x) & (-x) int tree [50024], num, N; void

# Include void chart (long ch []) {long a = 3; // The total number of letters long B = 2; // remember other letters other than O long c = 1; // The number of O long B1; // record the number of other letters last time ch [1] =; for (INT I = 2; I

This question is divided into four steps to compress, merge completely, compress to find the largest set Include Int set [10000000], Count [10000000];Int find (int x){Return set [x] = x? X: Set [x] = find (set [x]);}Void merge (int x, int y){Int A =

He almost made a quadratic equation of one yuan at the beginning, and he felt it only when POW was used later. Then he thought about the complexity. How can he solve it once for four yuan, finally, it was fun to create all the function values in the

A few days ago, I saw this water question in my school water question. I started to think it was a bit advanced (especially there is a prompt at the bottom, considering the number of incodes in Chinese characters, indicating that there is no organic

This topic is just like the previous step. First, find a part, then expand this part, and finally find the global optimal solution. Pay attention to it here, the test data he gave is too lewd. In fact, | K |> 100, so the max value is 1111 at

This is a tragedy. I have never been able to use Floyd. I am confused that I have changed n places or Wa for one night. Finally, I finally found out that the Floyd relationship was wrong. # Include int map [26] [26]; void Floyd () {for (INT I = 0;

Find the link for this question. If n microseconds are set, a (n) indicates the number of high-energy particles, and B (n) indicates the number of low-energy particles; After analysis, a (n) = 3 * a (n-1) + 2 * B (n-1), B (n) = a (n-1) + B (n-1

This school competition is over. It still works. Seven questions. However, F is really sorry. I typed all the tables. Method used. However, the output format is incorrect. Always wa. I did not answer the question in the last hour .. Okay .. I am

ACM This article is contributed by swellspirit ACM • I can accept failure. But I can't accept not trying.Life is often compared to a marathon, but I think it is more like beingSprinter; long stretches of hard work punctuated by brief moments in

This is the subject of this school competition. Link: http: // 218.75.208.59: 8084/acmhome/problemdetail. do? & Method = showdetail & id = 1060 Description: I am hereTime limit (Common/Java): 1000 ms/3000 Ms running memory limit: 65536 Kbyte Total

This question started to look a little troublesome, because it went up and down, but if you think about it, you only need to process one variable first, and there is only one variable left, is it enough to handle it? Right? It is connected to the

The data on this question is really disgusting. I started to knock it out. I 've been wa, But I re-typed it again. I finally read the code from the white box and found out that there are also disgusting data such as (0 0 ). # Include # include

Question .. Enumerate all possible values directly .. Finally, it is impossible to find the minimum number with a coefficient of 0. #include#includeint s[4] = {0,1,2,5},m1[100000],m2[100000],num[4],max;void gf( ){ memset( m1,0,sizeof( m1 ) );