Codeforces Round 625 (Div. 2, based on Technocup 2020 Final Round)
1 problems from Codeforces Round 625 (Div. 2, based on Technocup 2020 Final Round) (contest 1321), difficulty 1600-1600. 1/1 solutions verified against sample I/O.
Codeforces Round 625 (Div. 2, based on Technocup 2020 Final Round)
Div. 2 | 1 problems | 1/1 verified | Difficulty 1600-1600 | 3m 51s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| C | Remove Adjacent | 1600 | brute-force, constructive-algorithms, greedy | 10,525 | 3m 51s | ✓ |
Practice
›
Codeforces Solutions
›
Codeforces Round 625 (Div. 2, based on Technocup 2020 Final Round)
›
CF 1321C - Remove Adjacent
We are given a string of lowercase letters. We repeatedly remove characters under a local rule: a character can be deleted only if at least one of its current neighbors is exactly one letter earlier in the alphabet than itself.