Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4)
3 problems from Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) (contest 1277), difficulty 1000-1900. 1/3 solutions verified against sample I/O.
Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4)
Div. 2 | 3 problems | 1/3 verified | Difficulty 1000-1900 | 14m 28s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Happy Birthday, Polycarp! | 1000 | implementation | 14,486 | 2m 35s | |
| B | Make Them Odd | 1200 | greedy, number-theory | 17,040 | 9m 50s | ✓ |
| D | Let's Play the Words? | 1900 | data-structures, hashing, implementation | 3,275 | 2m 3s |
CF 1277B - Make Them Odd
We are given several independent test cases. In each test case, we start with a list of positive integers. One operation lets us pick a value $c$, but only if it is even, and then we simultaneously replace every occurrence of $c$ in the array by $c/2$.
CF 1277A - Happy Birthday, Polycarp!
There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…
CF 1277D - Let's Play the Words?
We are given a collection of binary strings, and we are allowed to optionally reverse some of them. After doing so, we want to arrange all strings in a single sequence such that every adjacent pair is compatible: the last character of a word must match the first character of…