Fast preliminary matter, since I retired soon leave legacy of it.
Preliminary inventory of what side door of knowledge (Pit) It
csp This year it is estimated that the whole multiple-choice questions, and in this way we know that scores will rise substantially, after all chance of Mongolia's more, it is estimatedDo notWhat weird error, or a particularly difficult topic.
Mainly multiple-choice questions and problem solving, the other almost no clatter fixed test sites, mainly to see friends algorithms accumulation and practice situations.
Multiple Choice
1. unscrupulous ad title
Ccf per year will be some strange concept questions, such as asking what time you ccf established. It is almost no solution, after all, want to guess what the topic. But you can still bet it is.
Last year, preliminary exam ccf PJTG are set up this kind of thing a few years, but in previous years noip relevant question test a lot
So noi official website is a review of the resource.
Worse is what I remember of the 2010 exam noi html links wording (|| -_-) is simply insane.
In short, does not it covered, all right, usually more save rp
2. Conceptual issues
What this basically too many columns are likely to finish the test, to see some of those priorities. Some knowledge about some of the operating system, particularly the windows, etc., byte conversion ah what, these too much, accumulating enough, say some of the highlights.
For example, ask the basic nature of your algorithm. The nature of the algorithm
For example, ask your computer network-related:
TCP / IP-related
Han ( Canton , city , bureau ) area network abbreviated ah, ah range, as well as representatives.
Even let you count the week
Basic computer knowledge, are some of the basic structure ah, all kinds of knowledge of the CPU. Computer systems divide software systems, hardware systems or something.
There are many test celebrities of the way China has test Turing Award Yao , Wang Xuan .
Computer network content, IP address, what type of ah, you hold the link, go directly to see the true problem.
P, NP problem :
I heard this thing a few years ago Tinghuo, there are many bolg, stuffing Liang Pian it
Some sort the problem, basically to test the stability of ah, ah complexity of what, so most times you play the hand thing
As well as the relevant language knowledge, c ++, java what language knowledge, basic test what object-oriented, inheritance, encapsulation, polymorphism ah Han, the bad luck on the line, is a very biased point addition, it is better review other.
. . . In fact, these are not a problem, usually write more questions, and then will find a lot will not learn on the line, it will say something so test (hehe point ???)
The basic concept of problem can be found in the Baidu Encyclopedia.
3. calculation problems (math)
Calculation problems, including some of the problems and combinatorics hex.
Binary class problem is not to lose points, no matter on which book has a detailed explanation. Ah, what the truth table is to be drawn.
The most common test complement, anti-code
XOR related and other bit operations, logic operations.
Here to talk about bits and logic operations are not the same, even though everyone knows this, but still a lot of time will not accidentally pit.
Bit arithmetic is integer arithmetic logic only true value and false value
& Related reference pointer and *
Do some of the topics, the other band-related analogies like
Complexity Analysis
Such a basic question of it each year, and sometimes water and sometimes very malignant tumor, but as long as the learned master theorem on the line, anything can be forced to set formulas.
About the main theorem that there is this
To sum up a word, the complexity of the before and after comparison to see which high and on the increase as Gesha Han log on the line.
Questions still to be done. This problem is also generally not particularly difficult.
Combinatorial Mathematics
A combination of multiple-choice math test some of the basic probability what to expect, as well as the minimum number of comparisons ah, and so on.
Graph theory calculation problems, we know what the basic nature of the bipartite graph, ah, as long as the test of time set on the line. What Toland Theorem ah what, maybe theorem in mathematics is also useful (but more in this problem solving).
The main expectation of what is the probability that this also learn fast, just to find something online to see the basic concepts of probability and calculation methods expectations and then do questions like, there are a number of teachers devoted the better. (Anyway, I can not do this)
What choice does not math test, the main problem solving.
4. Data structure
What is the right choice exam.
In fact, doing this just to know something about prefix and suffix expressions ah, after preorder tree traversal sequence ah Han, are the basics, this is also a difficult. Mainly hand there will be some queues to play stacks ah ah and out, as well as the list of add and delete nodes, and so on.
Some carefully, look at each option basically wrong (but I was wrong every day)
Here to know some basic knowledge of what methods of what binary, k-tree nodes is calculated. Hand play with small data will be able to know.
1.m layer over k-ary tree points to the m-th layer \ (k ^ {m-1 } \)
The total number of points over the multi-tree 2.m layer is \ (\ lfloor \ frac {k ^ m-1} {k-1} \ rfloor \)
3. For n k tree node, the number of which is a leaf node \ (n - \ frac {n + 1} {k} \)
5. MorestrangeTopics
emmm, this says no more than usual to accumulate more knowledge on the line, not to Mongolia, to do some good things up rp Europe.
Not say of
Problem Solving
Mathematics is a very important subject, the information is true, the problem is basically solved 10 points, a combination of mathematical theorem about mathematics related.
This is too e heart, and some weak players crit ah mathematical knowledge (like me).
To sum up, in fact, solve the problem with a lot of information on related topics, it is computationally intensive, but also know some of the series, some formulas and other methods to calculate the amount is great.
There is a 09 to 12 years of problem-solving organize, speak Listen, there are some questions there better solutions can be sent directly to Internet search.
Problem solving in particular, few questions is really behind the e mind, I was basically abandoned.
Csp is a good thing and hold problem-solving, it is expected to be placed in multiple-choice questions and become two points, a good thing ah.
Like, graph theory calculation problems , such as the
There are waiting you will need to push the formula, general term solution.
More of a combination of too much math, just look for can find a detailed analysis.
Special note of the number of columns, what Stirling numbers of second kind, Cattleya number of Han, speaking of these two basic will, at most, plus a Fibonacci number (like test rotten), in which the number of columns in the reading program also often appears a long and boring code might just find what Stirling numbers of second kind (a malignant tumor mind clear) with three methods.
A combination of mathematical probability expectation ah ah, at most, a binary test again, this time do not hesitate to draw the truth table, maybe there will be surprises. Of course, some of the sub enumerate what is the examination of the set. .
Sometimes back a few topics drawing, hand to play most of the short-circuit what should be no problem, most annoying problem is the count, a few number is gone.
In short, more questions, if math is no problem on the right.
Probably so much.
Reading program
This does not start speaking up, you never know what will ccf stuff.
Most questions are algorithms, algorithms learn more naturally know.
There's hand playing Han to find the law, playing a 8 minutes gone wrong, so to play more times.
The code is long and boring, a close look, do not collapse like a state of mind, I can not read look. Maybe play with small sample hand to find regular.
I fear to see what it is Gesha algorithm, the results set up a pit, the details of what changed, it is best to look at the code to push over a small sample.
Do not have time, or a malignant tumor behind two questions, then first look at the program fill in the blanks and then write back, or no time to blood loss.
On the sauce, learn algorithm, do not play the wrong hands.
Fill in the blank program
Like, it all depends on the accumulation, to test what could not speak.
More will the code written.
It is not, anyway, with multiple-choice questions can go in pushing it again.
About algorithm, emmm order count ( "algorithm contest Step-up Guide") Yes, considered guide ( "Introduction to Algorithms") to a senior, I have not seen.
For the preliminary round can directly buy "Informatics Olympiad through a" preliminary articles. There are also simulation questions Zhenti summary.
More questions more questions, do not say I have to write a title
In short, csp change the choice is still good.
Come on everybody, rp ++;
See more data, more questions, I feel I nonsense a bolg