Please subscribe to the official Codeforces channel in Telegram via the link ×

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

Revision en1, by SirRembocodina, 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.

Thanks to all the authors for a cool contest!

Tags 861, editorial, video, combinatorics


  Rev. Lang. By When Δ Comment
en1 English SirRembocodina 2023-03-31 06:11:12 388 Initial revision (published)