Theforces Round #34 (ABC-Forces)

7 problems from Theforces Round #34 (ABC-Forces) (contest 105350), difficulty -. 0/7 solutions verified against sample I/O.

7 items

Theforces Round #34 (ABC-Forces)

Special | 7 problems | 0/7 verified | Difficulty - | 15m 59s

#	Problem	Time
A	An OK Problem	1m 47s
B	A Cool Pair Problem	1m 35s
C	Yet Another Cool Pair Problem	5m 41s
D	Tuples Fusion	1m 56s
E	Fun is Counting	1m 49s
F	Mad MAD Sum II	1m 38s
G	Not An SQRT Problem	1m 33s

Practice › Codeforces Solutions › Theforces Round #34 (ABC-Forces) ›

CF 105350C - Yet Another Cool Pair Problem

We are given a single integer $n$ per test case, and we want to choose two different numbers $a$ and $b$ in the range $[1, n]$. The constraint is that the binary representations of $a$ and $b$ must not share any position where both have a 1, meaning their bitwise AND is zero.

Practice › Codeforces Solutions › Theforces Round #34 (ABC-Forces) ›

CF 105350G - Not An SQRT Problem

We are working on a rooted tree where every node initially holds value zero. Over time, we apply updates that either affect entire subtrees or only the immediate children of a node, and we also need to answer queries asking for maximum values over subtrees or over children sets.

Practice › Codeforces Solutions › Theforces Round #34 (ABC-Forces) ›

CF 105350E - Fun is Counting

We are given an array $a$ of size $n$. We want to count how many distinct multisets of size $n$ over values $1$ to $n$ can appear as follows. Imagine we construct an array $b$ of length $n$, where values are in the range $[1,n]$.

Practice › Codeforces Solutions › Theforces Round #34 (ABC-Forces) ›

CF 105350F - Mad MAD Sum II

We are given an array and asked to look at every contiguous subarray. For each subarray, we compute a value called the MAD, which is the largest number that appears at least twice inside that subarray. If no number repeats, the MAD is zero.

Practice › Codeforces Solutions › Theforces Round #34 (ABC-Forces) ›

CF 105350D - Tuples Fusion

We are given several independent test cases. In each test case there is a collection of pairs of numbers. Each pair behaves like a small container holding two values, and we are allowed to repeatedly perform operations that either destroy a container while collecting a…

Practice › Codeforces Solutions › Theforces Round #34 (ABC-Forces) ›

CF 105350A - An OK Problem

We are given a rectangular grid of size $n times m$, initially empty. We must choose a set of cells to color red and blue, with two strict structural constraints.

Practice › Codeforces Solutions › Theforces Round #34 (ABC-Forces) ›

CF 105350B - A Cool Pair Problem

We are given an upper bound $n$. From all pairs of integers $(a, b)$ such that both lie between 1 and $n$ and $a < b$, we are only allowed to consider those pairs where the bitwise AND of the two numbers is zero.