Codeforces Round #667 (Div. 3) Editorial

Revision en6, by vovuh, 2020-09-04 20:03:14

I'm so thankful to all testers, especially to Gassa and Rox for their invaluable help!

1409A - Yet Another Two Integers Problem

Idea: vovuh

Tutorial
Solution

1409B - Minimum Product

Idea: vovuh

Tutorial
Solution

1409C - Yet Another Array Restoration

Idea: vovuh

Tutorial
Solution (Gassa)
Solution (vovuh)
Solution (Rox)

1409D - Decrease the Sum of Digits

Idea: MikeMirzayanov

Tutorial
Solution

1409E - Two Platforms

Idea: vovuh

Tutorial
Solution

1409F - Subsequences of Length Two

Idea: vovuh

Tutorial
Solution
Solution (Gassa, greedy, O(n^4))

#### History

Revisions

Rev. Lang. By When Δ Comment
en6 vovuh 2020-09-04 20:03:14 1612
ru3 vovuh 2020-09-04 20:02:57 1613
ru2 vovuh 2020-09-04 19:55:15 2 (опубликовано)
en5 vovuh 2020-09-04 19:54:52 0 (published)
en4 MikeMirzayanov 2020-09-04 19:41:45 0 Tiny change: 'user:vovuh,2020-09-04]\n\n<spoi' -> 'user:vovuh]\n\n<spoi'
en3 MikeMirzayanov 2020-09-04 19:40:59 2 Tiny change: ' help!\n\n[probl' -> ' help!\n\n\n[probl'
en2 MikeMirzayanov 2020-09-04 19:40:27 2 Tiny change: ' help!\n\n[probl' -> ' help!\n\n1\n\n[probl'
ru1 vovuh 2020-09-04 17:29:11 7003 Первая редакция перевода на Русский (сохранено в черновиках)
en1 vovuh 2020-09-04 17:27:31 7033 Initial revision (saved to drafts)