Codeforces Round 605 (Div. 3)

3 problems from Codeforces Round 605 (Div. 3) (contest 1272), difficulty 1200-2200. 0/3 solutions verified against sample I/O.

3 items

Codeforces Round 605 (Div. 3)

Div. 3 | 3 problems | 0/3 verified | Difficulty 1200-2200 | 13m 56s

#	Problem	Rating	Tags	Accepted	Time
B	Snow Walking Robot	1200	constructive-algorithms, greedy, implementation	14,682	8m 54s
C	Yet Another Broken Keyboard	1200	combinatorics, dp, implementation	30,726	2m 45s
F	Two Bracket Sequences	2200	dp, strings, two-pointers	2,333	2m 17s

Practice › Codeforces Solutions › Codeforces Round 605 (Div. 3) ›

CF 1272B - Snow Walking Robot

We are given a sequence of moves for a robot on an infinite grid starting from the origin. Each character in the string tells the robot to move one step in one of the four cardinal directions.

Practice › Codeforces Solutions › Codeforces Round 605 (Div. 3) ›

CF 1272F - Two Bracket Sequences

We are given two sequences of brackets, s and t, which may individually be invalid as bracket sequences. The task is to produce the shortest string of brackets that is valid (balanced and properly nested) and contains both s and t as subsequences.

Practice › Codeforces Solutions › Codeforces Round 605 (Div. 3) ›

CF 1272C - Yet Another Broken Keyboard

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…