Codeforces Round #861 (Div. 2) – O(log N) solution for E + full video editorial

Правка en1, от rembocoder, 2023-03-31 06:11:12

Hello, I've made a full video editorial for the latest CF round. I'm a bit late, but I can compensate that by having a super-solution for problem E, which is faster than the authors' and also easier in my opinion.

https://www.youtube.com/watch?v=i1i_7lqnGwA

Thanks to all the authors for a cool contest!

Теги 861, editorial, video, combinatorics

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский rembocoder 2023-03-31 06:11:12 388 Initial revision (published)