Codeforces Round 127 (Div. 2)

2 problems from Codeforces Round 127 (Div. 2) (contest 202), difficulty 800-1700. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 127 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1700 | 4m 35s

# Problem Rating Tags Accepted Time ✓
A LLPS 800 binary-search, bitmasks, brute-force 19,754 1m 6s ✓
B Brand New Easy Problem 1700 brute-force 857 3m 29s ✓
Practice › Codeforces Solutions › Codeforces Round 127 (Div. 2) ›

CF 202A - LLPS

We are given a lowercase string and must choose some characters, in order, to form a subsequence that is both a palindrome and lexicographically as large as possible. A subsequence does not need to stay contiguous.
codeforces competitive-programming binary-search bitmasks brute-force greedy implementation strings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 127 (Div. 2) ›

CF 202B - Brand New Easy Problem

We are given the title words of Lesha's new problem and several archive problems from Torcoder. The words in Lesha's title are all distinct. An archive title may repeat words.
codeforces competitive-programming brute-force May 29, 2026