Codeforces Round 599 (Div. 2)

3 problems from Codeforces Round 599 (Div. 2) (contest 1243), difficulty 800-1600. 2/3 solutions verified against sample I/O.

3 items

Codeforces Round 599 (Div. 2)

Div. 2 | 3 problems | 2/3 verified | Difficulty 800-1600 | 15m 9s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Maximum Square	800	implementation	16,377	6m 24s	✓
B1	Character Swap (Easy Version)	1000	strings	15,358	5m 7s	✓
B2	Character Swap (Hard Version)	1600	strings	7,307	3m 38s

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

CF 1243B1 - Character Swap (Easy Version)

We are given two strings of equal length, and we are allowed to perform exactly one swap operation. The swap is constrained in a specific way: we pick one position in the first string and one position in the second string, then exchange those two characters.

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

CF 1243B2 - Character Swap (Hard Version)

We are given two strings of equal length, and we are allowed to repeatedly fix them using a very specific operation: pick one character from the first string and one character from the second string, and swap them.

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

CF 1243A - Maximum Square

We are given several test cases, each consisting of a list of plank heights. Every plank has width 1 and some integer height.