TheForces Round #20 (7-Problems-Forces)

7 problems from TheForces Round #20 (7-Problems-Forces) (contest 104471), difficulty -. 4/7 solutions verified against sample I/O.

7 items

TheForces Round #20 (7-Problems-Forces)

Special | 7 problems | 4/7 verified | Difficulty - | 13m 25s

#	Problem	Time	✓
A	Tuples	1m 39s	✓
B	2-set Problem	1m 41s	✓
C	Extended Average	3m 52s
D	Array Counting	1m 37s	✓
E	The Boss Arena	1m 53s
F	Happy Numbers	1m 31s
G	Angel's Salad	1m 12s	✓

Practice › Codeforces Solutions › TheForces Round #20 (7-Problems-Forces) ›

CF 104471F - Happy Numbers

We are working with a digit transformation process where a number is repeatedly replaced by the sum of squares of its digits. Starting from any positive integer, this transformation eventually either reaches 1 or falls into a repeating cycle that never includes 1.

Practice › Codeforces Solutions › TheForces Round #20 (7-Problems-Forces) ›

CF 104471G - Angel's Salad

We are given an array of length $n$, initially filled with zeros. Alongside this, there are $m$ fixed intervals, each describing a contiguous segment of the array.

Practice › Codeforces Solutions › TheForces Round #20 (7-Problems-Forces) ›

CF 104471C - Extended Average

We are given a directed graph where each edge has a weight, and we are allowed to walk through the graph by following directed edges. A walk can reuse vertices and edges.

Practice › Codeforces Solutions › TheForces Round #20 (7-Problems-Forces) ›

CF 104471E - The Boss Arena

The task describes a one-dimensional arena made of tiles from 1 to $n$. You start at position $s$, and over $m$ discrete moments a boss fires attacks that forbid standing inside a specific segment $[li, ri]$.

Practice › Codeforces Solutions › TheForces Round #20 (7-Problems-Forces) ›

CF 104471D - Array Counting

We are given multiple independent queries. Each query gives two integers, where we must construct arrays of fixed length whose entries are strictly positive and whose sum is fixed.

Practice › Codeforces Solutions › TheForces Round #20 (7-Problems-Forces) ›

CF 104471B - 2-set Problem

We are given two multisets, each of size $n$. Think of them as two rows of numbers, $s$ and $t$, each containing exactly $n$ elements, where repetitions are allowed. In one move, we pick one element from $s$ and one element from $t$, but only if the values are different.

Practice › Codeforces Solutions › TheForces Round #20 (7-Problems-Forces) ›

CF 104471A - Tuples

We are given several independent test cases. In each test case, we have a collection of pairs. Each pair consists of a positive weight $ai$ and a sign $bi$ that is either $+1$ or $-1$.