Saying this exam T1 and T2 is really water, however T1CE, T2TLE, T3CE
Is not that an insult to my intelligence ah! Before native compilers are c ++, ++ 11 after use c .
The T1 is a large find of the law, I have to find out the law, but even with the law of violence achievements? woc, I was not awake yet?
It seems I'm a . 2B . The key is to contribute to achievements, I also hung up a hashmap, then keywords collision, even sub-violence are not!
In fact, the law but when the test was thought out but I was playing a prefix fibonaqi and glanced at, and then found a small, then I think this question on a test rule, then violence contribution (pure crap!) then happy to play a positive solution a very close distance of violence, then I think there's value may be deep-fried, then mount a hash of it, and then he died
T2 a look I thought of the number of colors that road before the rest of the sub-topic fast, then I think that questions like the A, but violence seems to be off the water, so the heart of a number of towering, although the reading problem not the original title, but still true, then divide quickly took a violent pay up, but did not take a minute faster like, and then only have to take the score or violence ( because my T1 and T3 have a CE ), in fact, is a vector-half, I also believe that a lot of people have learned a data structure silly , surely someone sets of tree cover tree the tree. In fact solution to a problem, 5 minutes to AC, critical thinking is the problem of a look, even if the solution to a problem you can immediately read the AC, but what use is it? , After all, when the examination no points are white torn!
This question did not think the main problem is to think of it too complicated!
T3 First up is no problem to read ( the old man to pull my endorsement of the late news! ), After all, the language level is not high, read the year he came to understand the meaning of the title, and then a surprise to know that the first four points qj it out and then qjk == 1 point, but because of the advantages of a hashmap, I successfully fell eight points from 36, then CE, and fell into a 0 .
In fact, this question is a data point partition (I was drunk) k == 1 when violence qj () anyway, you can too ! k == 2 is similar to when the imprisoned criminals and the investigation and collection (but moudinggg using bipartite graph matching success violence grind scalar operators, orz %%%) then, is to look at some of the details, it is cut, and this problem solution five minutes to play the very short notice, in some places to sell, and I go to brush the question!