TheForces Round #22 (Interesting-Forces)

6 problems from TheForces Round #22 (Interesting-Forces) (contest 104542), difficulty -. 1/6 solutions verified against sample I/O.

6 items

TheForces Round #22 (Interesting-Forces)

Special | 6 problems | 1/6 verified | Difficulty - | 14m 58s

#	Problem	Time	✓
A	Interesting Subsequence	1m 24s
B	Interesting Connection	3m 40s
C	Interesting Operation	1m 19s
D	Interesting Snake Queue	5m 19s
E	Interesting Alternating Sum	1m 28s
F	Interesting String Problem	1m 48s	✓

Practice › Codeforces Solutions › TheForces Round #22 (Interesting-Forces) ›

CF 104542D - Interesting Snake Queue

Codeforces 104542D: Interesting Snake Queue

Practice › Codeforces Solutions › TheForces Round #22 (Interesting-Forces) ›

CF 104542F - Interesting String Problem

We are given a set of isolated nodes, each node carrying a fixed small string. Over time, edges are added, so the nodes gradually form connected components. These components behave like groups that grow as unions are performed.

Practice › Codeforces Solutions › TheForces Round #22 (Interesting-Forces) ›

CF 104542B - Interesting Connection

We are asked to construct an array of positive integers with two constraints: its length is fixed to $n$, and the sum of all elements is exactly $k$.

Practice › Codeforces Solutions › TheForces Round #22 (Interesting-Forces) ›

CF 104542E - Interesting Alternating Sum

We are given a permutation of size $n$. We repeatedly modify the array from left to right. At step $i$, we take the prefix $p[1..

Practice › Codeforces Solutions › TheForces Round #22 (Interesting-Forces) ›

CF 104542A - Interesting Subsequence

We are given an array and we are allowed to pick any subsequence of it as a candidate sequence $b$. The twist is that we are not checking $b$ against the original array alone, but against a family of derived arrays.

Practice › Codeforces Solutions › TheForces Round #22 (Interesting-Forces) ›

CF 104542C - Interesting Operation

We are given a string of lowercase English letters. Each operation allows us to pick two different positions and simultaneously shift both characters one step backward in the alphabet, where shifting means that b becomes a, c becomes b, and so on cyclically so that a becomes z.