Editorial of Codeforces Round #768

Revision en2, by BrayanD, 2022-01-27 19:47:44

1631A - Min Max Swap

Hint 1
Hint 2
Solution

1631B - Fun with Even Subarrays

Hint 1
Hint 2
Solution

1630A - And Matching

Hint 1
Hint 2
Constructive approach (easier)
Greedy approach (harder)
Randomized approach (harder)

1630B - Range and Partition

Hint 1
Hint 2
Hint 3
Hint 4
Solution

1630C - Paint the Middle

Hint 1
Hint 2
Hint 3
Solution

1630D - Flipping Range

Hint 1
Hint 2
Hint 3
Solution

1630E - Expected Components

Hint 2
Hint 3
Solution

1630F - Making It Bipartite

Hint 1
Hint 2
Hint 3
Solution

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en13 English BrayanD 2022-01-28 15:59:20 4 Tiny change: 'f( i != 0 || i != smal' -> 'f( i != 0 && i != smal'
en12 English BrayanD 2022-01-27 21:45:52 46
en11 English BrayanD 2022-01-27 21:17:55 0 (published)
en10 English BrayanD 2022-01-27 21:17:28 0 (saved to drafts)
en9 English BrayanD 2022-01-27 21:01:19 0 (published)
en8 English BrayanD 2022-01-27 21:00:16 10
en7 English dmga44 2022-01-27 20:36:06 8
en6 English dmga44 2022-01-27 20:17:05 33
en5 English BrayanD 2022-01-27 20:00:00 370
en4 English BrayanD 2022-01-27 19:54:42 254
en3 English BrayanD 2022-01-27 19:51:45 98
en2 English BrayanD 2022-01-27 19:47:44 4 Tiny change: '1631A]\n\n<spoil' -> '1631A]\n\n\n<spoil'
en1 English BrayanD 2022-01-27 19:46:18 45749 Initial revision (saved to drafts)