Codeforces Round 179 (Div. 2)

2 problems from Codeforces Round 179 (Div. 2) (contest 296), difficulty 1100-2000. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 179 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1100-2000 | 3m 5s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Yaroslav and Permutations	1100	greedy, math	26,032	1m 35s	✓
B	Yaroslav and Two Strings	2000	combinatorics, dp	2,678	1m 30s	✓

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

CF 296B - Yaroslav and Two Strings

We are given two digit strings of equal length, but some positions may contain unknown characters represented by ?. Each ? can independently be replaced by any digit from 0 to 9, and choices in different positions do not interact.

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

CF 296A - Yaroslav and Permutations

Yaroslav has a sequence of integers, and he wants to rearrange them so that no two consecutive elements are equal. The only allowed operation is swapping two neighboring elements, and he wants to know if it is possible to reach a configuration satisfying this condition.