Codeforces Round 526 (Div. 2)

3 problems from Codeforces Round 526 (Div. 2) (contest 1084), difficulty 1000-1500. 2/3 solutions verified against sample I/O.

3 items

Codeforces Round 526 (Div. 2)

Div. 2 | 3 problems | 2/3 verified | Difficulty 1000-1500 | 8m 25s

#	Problem	Rating	Tags	Accepted	Time	✓
A	The Fair Nut and Elevator	1000	brute-force, implementation	8,229	3m	✓
B	Kvass and the Fair Nut	1200	greedy, implementation	8,286	2m 24s	✓
C	The Fair Nut and String	1500	combinatorics, dp, implementation	11,647	3m 1s

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

CF 1084C - The Fair Nut and String

We are given a string made of lowercase letters and we are interested only in the positions of two characters, namely 'a' and 'b'. From this string, we want to count how many strictly increasing sequences of indices we can form such that every chosen index points to an 'a'.

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

CF 1084A - The Fair Nut and Elevator

The problem describes a single elevator in a building where each floor has a known number of residents. Each resident makes exactly two trips per day, one going down to the first floor and one returning back to their own floor.

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

CF 1084B - Kvass and the Fair Nut

We are given several kegs of kvass, each containing some initial amount. In one operation, we can reduce any single keg by exactly one liter, and each such operation contributes one liter toward a total amount we want to “pour out”.