TheForces Round #25(5^2-Forces)

5 problems from TheForces Round #25(5^2-Forces) (contest 104743), difficulty -. 0/5 solutions verified against sample I/O.

5 items

TheForces Round #25(5^2-Forces)

Special | 5 problems | 0/5 verified | Difficulty - | 4m 32s

#	Problem	Time
A	Make All Elements 0	30s
B	Array Construction	1m 36s
C	Prefix MEX Problem	1m 24s
E	Range Modulo Queries	35s
F	Yet Another Tree Problem	27s

Practice › Codeforces Solutions › TheForces Round #25(5^2-Forces) ›

CF 104743B - Array Construction

We are asked to decide whether it is possible to build an array of length n using distinct integers such that two global bitwise constraints are satisfied simultaneously.

Practice › Codeforces Solutions › TheForces Round #25(5^2-Forces) ›

CF 104743F - Yet Another Tree Problem

Working

Practice › Codeforces Solutions › TheForces Round #25(5^2-Forces) ›

CF 104743C - Prefix MEX Problem

We are given an array of non-negative integers. We are allowed to modify elements, but each modification has a very specific rule: if we choose position i, we overwrite a[i] with the MEX of the prefix strictly before it, meaning the smallest non-negative integer that does not…

Practice › Codeforces Solutions › TheForces Round #25(5^2-Forces) ›

CF 104743E - Range Modulo Queries

We are given two arrays of the same length. For every query interval, we are asked to find a modulus value $m$ such that when we take every element $ai$ in that interval and compute $ai bmod m$, we obtain exactly the corresponding $bi$.

Practice › Codeforces Solutions › TheForces Round #25(5^2-Forces) ›

CF 104743A - Make All Elements 0

We are given an array of non-negative integers. In a single operation, we choose a contiguous segment and apply a bitwise AND with some value $x$, where $1 le x le k$. This operation overwrites every element in the chosen segment by clearing some of its bits according to $x$.