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.

Good luck in your endeavors!

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!