Good Bye 2020 Editorial

Правка en7, от Anadi, 2020-12-30 22:04:37

1466A - Bovine Dilemma

Tutorial
Solution 1
Solution 2
Challenge

1466B - Last minute enhancements

Tutorial
Solution 1
Solution 2
Challenge

1466C - Canine poetry

Tutorial
Solution
Challenge

1466D - 13th Labour of Heracles

Tutorial
Solution

1466E - Apollo versus Pan

Tutorial
Solution

1466F - Euclid's nightmare

Tutorial
Solution

1466G - Song of the Sirens

Tutorial
Solution

1466H - Finding satisfactory solutions

Tutorial
Solution

1466I - The Riddle of the Sphinx

Tutorial
Solution

I am really interested in solving this task using fewer queries or proving that $$$3 \cdot (n + b)$$$ is optimal. Does anyone have any idea how to answer these questions?

UPD: There are challenges added to some tasks.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en10 Английский Anadi 2021-01-01 16:36:08 50
en9 Английский Anadi 2020-12-31 15:13:31 1474 Tiny change: '\n}\n```\n\n<spoil' -> '\n}\n```\n</spoiler>\n\n<spoil'
en8 Английский Anadi 2020-12-30 22:05:27 0 (published)
en7 Английский Anadi 2020-12-30 22:04:37 2 Tiny change: 'ving that 3 \cdot (n + b) is optima' -> 'ving that $3 \cdot (n + b)$ is optima'
en6 Английский Anadi 2020-12-30 21:53:57 396 (saved to drafts)
en5 Английский Anadi 2020-12-30 21:05:00 116 Tiny change: '?\n\n**UPD** There some challeng' -> '?\n\n**UPD:** There are challeng'
en4 Английский Anadi 2020-12-30 21:01:49 0 (published)
en3 Английский Anadi 2020-12-30 21:00:48 537 (saved to drafts)
en2 Английский Anadi 2020-12-30 20:42:03 1 (published)
en1 Английский Anadi 2020-12-30 20:41:42 14649 Initial revision (saved to drafts)