Codeforces Round 952 (Div. 4)

Solutions for Codeforces Round 952 (Div. 4) (contest 1985). 6/9 problems verified against sample I/O. Difficulty range: 800-2200.

9 items

Codeforces Round 952 (Div. 4)

Type: Div. 4 | Problems: 9 | Verified: 6/9 | Rating range: 800-2200 | Time: 20m 35s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Creating Words	800	implementation, strings	2m 27s	✓
B	Maximum Multiple Sum	800	brute-force, math, number-theory	2m	✓
C	Good Prefixes	1000	greedy	2m 38s	✓
D	Manhattan Circle	900	implementation, math	1m 29s	✓
E	Secret Box	1200	brute-force, combinatorics, math	2m 31s	✓
F	Final Boss	1500	binary-search, data-structures	2m 23s	✓
G	D-Function	1600	combinatorics, math, number-theory	2m 22s	✗
H1	Maximize the Largest Component (Easy Version)	1700	brute-force, data-structures, dfs-and-similar	2m 32s	✗
H2	Maximize the Largest Component (Hard Version)	2200	data-structures, dfs-and-similar, dp	2m 13s	✗

Practice › Codeforces Solutions › Codeforces Round 952 (Div. 4) ›

CF 1985H1 - Maximize the Largest Component (Easy Version)

We are given a grid consisting of n rows and m columns, where each cell is either empty ('.') or filled (''). A connected component of filled cells is a set of '' tiles where you can move between any two tiles by only traveling along adjacent tiles sharing a side.

Practice › Codeforces Solutions › Codeforces Round 952 (Div. 4) ›

CF 1985H2 - Maximize the Largest Component (Hard Version)

We are given a grid of size $n times m$ where each cell is either empty ('.') or filled (''). Connected components of '' are sets of cells that can reach each other by moving up, down, left, or right.

Practice › Codeforces Solutions › Codeforces Round 952 (Div. 4) ›

CF 1985G - D-Function

The problem asks us to count numbers $n$ in a given range such that multiplying $n$ by an integer $k$ scales the sum of digits by exactly $k$. Formally, if $D(n)$ is the sum of digits of $n$, we want all $n$ in $[10^l, 10^r)$ satisfying $D(k cdot n) = k cdot D(n)$.

Practice › Codeforces Solutions › Codeforces Round 952 (Div. 4) ›

CF 1985F - Final Boss

We are asked to simulate a battle with a single boss that has a starting health h. The player has n different attacks. Each attack i deals ai damage and has a cooldown ci, meaning that once used, that attack cannot be reused for ci turns.

Practice › Codeforces Solutions › Codeforces Round 952 (Div. 4) ›

CF 1985E - Secret Box

We are asked to place a small box with integer side lengths inside a larger box in 3D space. The small box must have a specific volume $k$ and must align with the axes, with all corners at integer coordinates.

Practice › Codeforces Solutions › Codeforces Round 952 (Div. 4) ›

CF 1985D - Manhattan Circle

We are given a grid made of dots and hashes. Somewhere in this grid there is a shape formed by all cells whose Manhattan distance to a hidden center is strictly less than a radius. This creates a diamond-shaped region aligned with the grid axes.

Practice › Codeforces Solutions › Codeforces Round 952 (Div. 4) ›

CF 1985C - Good Prefixes

The problem asks us to analyze prefixes of an integer array and determine which prefixes are "good" according to a specific rule. A prefix of length $i$ is considered good if there exists an element in the prefix equal to the sum of all other elements.

Practice › Codeforces Solutions › Codeforces Round 952 (Div. 4) ›

CF 1985A - Creating Words

We are given two strings, each exactly three letters long, and our task is to swap their first characters. For each test case, the input provides two strings, and the output should reflect the two new strings formed after the swap.

Practice › Codeforces Solutions › Codeforces Round 952 (Div. 4) ›

CF 1985B - Maximum Multiple Sum

We are asked to select a number $x$ between 2 and $n$ inclusive such that the sum of all multiples of $x$ that do not exceed $n$ is maximized. For example, if $n = 15$ and we pick $x = 2$, the multiples are 2, 4, 6, 8, 10, 12, 14, and their sum is 56.