English version is in beta. All contents of the site should be already translated (mostly using machine translation), and everything should work properly. However, if you find any problems, please contact me.
Level 7A
To advance to the next level, you need to solve all problems.
Simple games on graphs
Combinatorics
For a number of combinatorial objects (sequences of zeros and ones, permutations, etc.),
there are interesting algorithms such as generating the next object from the current one, etc.
These algorithms are not very applicable (in fact, that's why the topic is on so high a level on algoprog),
in most cases it's easier to write an algorithm based on recursive iteration or dynamics,
but it is also useful to know specific special algorithms.
Breadth-first search in 1-k and 0-k graphs
SIS videos, 2013, B'
SIS videos, 2008, B' (see this and the following topics, up to "Repetition: Shortest paths in a 0-1 graph.")
SIS videos, 2008, B' (see this and the following topics, up to "Repetition: Shortest paths in a 0-1 graph.")
algoprog.ru © Petr Kalinin, GNU AGPL, github.com/petr-kalinin/algoprog | About the license for the site materials | Blog (in Russian)