arrow_back Is it worth it to start preparing for olympic programming in the 10th grade, and what language is better to choose?

Question

I study in the 10th grade, I want to start to engage in olympic programming (I already know the basics of Python).
Is there enough time for me to prepare to take the prizewinner of the listed programming Olympiads? Or is it better not to risk and prepare for the USE in computer science?
Is Python enough to take the prize of the list, and if not, what is worth learning?

Comments

Is it hard to look it up before you ask? It's been answered a thousand times already:

---

Nikita Koshcheev you are not the first one to want to know, this question has already been asked.

---

Igor Makhov I want to understand if it is possible to win the list with only one Python. Is it realistic or not. Or is it necessary to know cc++, java.

Answer 1

Hello. It is a little late to start programming from 10th grade, but you can prepare for 11th grade by learning basic and not so basic algorithms. I would advise to learn C++, because Ruth often does not fit into the time constraints.

In general, it is necessary to know roothon at a basic level, too, so that you do not have to write long arithmetic.

Learn c++ on these topics (written in order of study): - Input-output- Conditional statements (if - else, switch - case, ternary conditional statement)- Loops (for, while, do while)- Arrays (one-dimensional, two-dimensional)- Functions- Recursions- Graphs, introduction to graph theory- BFS (breadth traversal)- DFS (depth traversal)- Binary search- Greedy algorithm-Dynamic programming (also: NOP, NVP, backpacking problem)- Learn built-in containers: vector, set, multiset, map, multimap, queue, priority_queue, stack, dequeue, list

Learn c++ on these topics (written in order of study): - Input-output- Conditional statements (if - else, switch - case, ternary conditional statement)- Loops (for, while, do while)- Arrays (one-dimensional, two-dimensional)- Functions- Recursions- Graphs, introduction to graph theory- BFS (breadth traversal)- DFS (depth traversal)- Binary search- Greedy algorithm-Dynamic programming (also: NOP, NVP, backpacking problem)- Learn built-in containers: vector, set, multiset, map, multimap, queue, priority_queue, stack, dequeue, list

If you intend to participate not only in the list olympiads, but also to prepare for 11th grade for the regional and final stage of the WOSH: - DP on sub-sections, on sub-trees, on subsets (submasks), on profile, on broken profile-Tree of segments with mass operations, Cartesian tree (+ by implicit key), Fenwick tree (multidimensional) - Intersecting sets system - Sparse table - Finding LCA - Root optimization - Minimal hulk (Prima algorithm, Kruskal algorithm, Tarjan algorithm) - Z-functions - Bohr - Hashes - Heaps

Also, to all this, should tighten math, in particular geometry: - Finding the distance from a point to a straight line - Vectors (scalar and vector product) - And the logic will not hurt

Good luck in your endeavors!