Codeforces Round 253 (Div. 2)

2 problems from Codeforces Round 253 (Div. 2) (contest 443), difficulty 800-1500. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 253 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1500 | 2m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Anton and Letters	800	constructive-algorithms, implementation	111,989	1m 19s	✓
B	Kolya and Tandem Repeat	1500	brute-force, implementation, strings	4,274	1m 28s	✓

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

CF 443B - Kolya and Tandem Repeat

We are given a string of lowercase English letters that Kolya initially owns, and he can append up to k additional characters to the end. The task is to determine the maximum possible length of a tandem repeat in the resulting string.

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

CF 443A - Anton and Letters

We are given a single formatted string that represents a set of lowercase English letters. The set is written in a very specific textual form: it starts with an opening brace, ends with a closing brace, and inside the braces letters are listed separated by comma and space.