Infoleague Autumn 2021 Round 2 Div. 1

3 problems from Infoleague Autumn 2021 Round 2 Div. 1 (contest 103423), difficulty -. 1/3 solutions verified against sample I/O.

3 items

Infoleague Autumn 2021 Round 2 Div. 1

Div. 1 | 3 problems | 1/3 verified | Difficulty - | 4m 4s

#	Problem	Time	✓
A	Bordered Subarrays	34s
B	Vacuum Cleaner	2m 38s
C	Birthday Nim	52s	✓

Practice › Codeforces Solutions › Infoleague Autumn 2021 Round 2 Div. 1 ›

CF 103423B - Vacuum Cleaner

Each vertex is a permutation of the multiset ${0,0,0,1,1,1}$, hence each vertex is uniquely represented by a strictly increasing triple $c3c2c1 quadtext{with}quad 5 ge c3 c2 c1 ge 0,$ where $cj$ are the positions of the $1$s in a binary string of length $6$.

Practice › Codeforces Solutions › Infoleague Autumn 2021 Round 2 Div. 1 ›

CF 103423C - Birthday Nim

We are given several stacks of coins, each stack representing a pile with a fixed initial height. Two players play a turn-based game starting from these piles. On each turn, a player chooses some stacks and removes coins from them.

Practice › Codeforces Solutions › Infoleague Autumn 2021 Round 2 Div. 1 ›

CF 103423A - Bordered Subarrays

I don’t have the actual statement of Codeforces 103423A - Bordered Subarrays in your prompt, and I shouldn’t guess it because that would lead to a completely incorrect editorial.