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 5A
To advance to the next level, you need to solve all problems.
Simple geometry
See the video recordings of lectures of LKSH.2013.B', section "Computational Geometry".
See the video recordings of lectures of LKSH.2008.B', section "Computational Geometry".
See the video recordings of lectures of LKSH.2008.B', section "Computational Geometry".
Counting sort
See video recordings of lectures of the Parallel C LCS'
See the videos of lectures of the SIS parallel B' (old): one and two
See video recordings of lectures of the SIS Parallel B' (new)
See the videos of lectures of the SIS parallel B' (old): one and two
See video recordings of lectures of the SIS Parallel B' (new)
Unfortunately, the set of tasks below is not very representative, but there are no more interesting tasks for count sort on informatics.
Bignum arithmetic
Bignum arithmetic is not often required in contests now (if the answer to the problem can be large, then more often you will be asked to calculate the remainder by some modulo), but nevertheless you need to have an idea about algorithms and be able to write them.
Theory of bignum arithmetic (V. Goldstein)
A video recording of a lecture from some SIS (I suspect that SIS.2008.C)
Theory of bignum arithmetic (V. Goldstein)
A video recording of a lecture from some SIS (I suspect that SIS.2008.C)
algoprog.ru © Petr Kalinin, GNU AGPL, github.com/petr-kalinin/algoprog | About the license for the site materials | Blog (in Russian)