TheForces Round #24 (DIV3-Forces)

6 problems from TheForces Round #24 (DIV3-Forces) (contest 104683), difficulty -. 1/6 solutions verified against sample I/O.

6 items

TheForces Round #24 (DIV3-Forces)

Special | 6 problems | 1/6 verified | Difficulty - | 8m 47s

#	Problem	Time	✓
A	Banis and Cards	1m 15s	✓
B	Left or Right Shift	1m 25s
C	Yet Another \u00f72 or +1 Problem	1m 43s
D	Sum and Difference	1m 34s
E	L-shaped Dominoes	1m 31s
G	Useless Trick	1m 19s

Practice › Codeforces Solutions › TheForces Round #24 (DIV3-Forces) ›

CF 104683E - L-shaped Dominoes

We are given a grid with exactly two rows and $n$ columns. Each cell contains an arbitrary integer, and we are allowed to place shapes that occupy three cells arranged in an L configuration inside a $2 times 2$ block.

Practice › Codeforces Solutions › TheForces Round #24 (DIV3-Forces) ›

CF 104683G - Useless Trick

We are given a binary string and a fixed window length $m$. The string is considered valid only if every contiguous substring of length $m$ contains exactly $k$ ones.

Practice › Codeforces Solutions › TheForces Round #24 (DIV3-Forces) ›

CF 104683C - Yet Another ÷2 or +1 Problem

We are given a string and a number of iterations. A single operation transforms the string according to a simple rule that depends only on whether the string is a palindrome.

Practice › Codeforces Solutions › TheForces Round #24 (DIV3-Forces) ›

CF 104683D - Sum and Difference

We are asked to build a sequence of length $n$, where each element lies inside a fixed integer interval $[l, r]$.

Practice › Codeforces Solutions › TheForces Round #24 (DIV3-Forces) ›

CF 104683B - Left or Right Shift

We are given a string of lowercase English letters, and we are allowed to modify it using a fixed number of operations. Each operation picks a single character and moves it one step forward or backward in the cyclic alphabet, where a follows z and z follows a.

Practice › Codeforces Solutions › TheForces Round #24 (DIV3-Forces) ›

CF 104683A - Banis and Cards

We are given a collection of cards numbered from 1 up to n. For each query, someone chooses a value m and asks for the sum of all card numbers that are divisible by m. In other words, we are summing every multiple of m that appears in the range from 1 to n.