Codeforces Round 598 (Div. 3)

3 problems from Codeforces Round 598 (Div. 3) (contest 1256), difficulty 1000-2000. 1/3 solutions verified against sample I/O.

6 items

Codeforces Round 598 (Div. 3)

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

#	Problem	Rating	Tags	Accepted	Time	✓
A	Payment Without Change	1000	math	32,430	1m 50s	✓
B	Minimize the Permutation	1400	greedy	13,682	1m 47s
F	Equalizing Two Strings	2000	constructive-algorithms, sortings, strings	3,621	1m 25s

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

CF 1256B - Minimize the Permutation

We are given several test cases, each consisting of a permutation, meaning an array containing every integer from 1 to n exactly once. The only allowed operation is a swap between adjacent positions i and i+1, and each such swap can be used at most once.

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

CF 1256F - Equalizing Two Strings

We are given two strings of equal length, and we are allowed to repeatedly perform a synchronized operation: pick a length len, choose any substring of that length in the first string, reverse it, and independently choose any substring of the same length in the second string…

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

CF 1256A - Payment Without Change

We are asked to determine whether a target sum S can be constructed using two types of coins. One type has value n and there are a coins of it, the other type has value 1 and there are b coins of it.