Codeforces Round 135 (Div. 2)

Solutions for Codeforces Round 135 (Div. 2) (contest 219). 3/3 problems verified against sample I/O. Difficulty range: 1000-1600.

3 items

Codeforces Round 135 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 1000-1600 | Time: 5m 50s

Problem	Name	Rating	Tags	Solve Time	Verified
A	k-String	1000	implementation, strings	1m 22s	✓
B	Special Offer! Super Price 999 Bourles!	1400	implementation	1m 29s	✓
C	Color Stripe	1600	brute-force, dp, greedy	2m 59s	✓

Practice › Codeforces Solutions › Codeforces Round 135 (Div. 2) ›

CF 219A - k-String

We are given a lowercase string and an integer k. We may rearrange the letters however we want. The goal is to build a new string that consists of exactly k identical blocks placed one after another.

Practice › Codeforces Solutions › Codeforces Round 135 (Div. 2) ›

CF 219B - Special Offer! Super Price 999 Bourles!

Polycarpus already knows the best regular price for his product, p. He is willing to reduce it by at most d bourles if that gives the final price a more attractive ending, specifically as many trailing nines as possible. A trailing nine means a digit 9 at the end of the number.

Practice › Codeforces Solutions › Codeforces Round 135 (Div. 2) ›

CF 219C - Color Stripe

We are given a stripe consisting of $n$ square cells, each painted in one of $k$ colors. The stripe is represented as a string of uppercase letters, where each letter corresponds to a color. The goal is to repaint some cells so that no two adjacent cells share the same color.