Codeforces Round 832 (Div. 2)

Solutions for Codeforces Round 832 (Div. 2) (contest 1747). 2/5 problems verified against sample I/O. Difficulty range: 800-2900.

5 items

Codeforces Round 832 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 2/5 | Rating range: 800-2900 | Time: 20m 27s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Two Groups	800	constructive-algorithms, greedy	6m 6s	✓
B	BAN BAN	900	constructive-algorithms	2m 39s	✗
C	Swap Game	1200	games	2m 12s	✓
D	Yet Another Problem	1900	binary-search, bitmasks, constructive-algorithms	2m 12s	✗
E	List Generation	2900	combinatorics, dp, math	7m 18s	✗

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

CF 1747E - List Generation

We are asked to count structures made of two non-decreasing sequences of integers that start at zero and end at $n$ and $m$, respectively. The sequences, which we can call $a$ and $b$, must satisfy that no consecutive pair of elements sum to the same value.

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

CF 1747A - Two Groups

We are given a sequence of integers and we must split it into two disjoint groups. Every element must go into exactly one group, and both groups are allowed to be empty. Once the split is fixed, we compute the sum of each group.

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

CF 1747D - Yet Another Problem

We are given a static array and multiple queries on contiguous segments. For each query segment, we are allowed to repeatedly apply a very specific transformation: pick any subsegment of odd length, compute the XOR of all values inside it, and overwrite the entire chosen…

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

CF 1747B - BAN BAN

Let the triangle be $ABC$, let $H$ be its orthocenter, and let $omega$ be its incircle with center $I$ and radius $r$. The beetles move along the altitudes. Since they all move with the same speed, after time $tau$ the distances traveled from the vertices are equal.

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

CF 1747C - Swap Game

We are asked to determine the winner in a two-player game played on an array of positive integers. Alice moves first. On each turn, the player inspects the first element of the array. If it is zero, the player loses immediately.