Codeforces Round 943 (Div. 3)

8 problems from Codeforces Round 943 (Div. 3) (contest 1968), difficulty 800-2200. 3/8 solutions verified against sample I/O.

8 items

Codeforces Round 943 (Div. 3)

Div. 3 | 8 problems | 3/8 verified | Difficulty 800-2200 | 12m 57s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Maximize?	800	brute-force, math, number-theory	39,447	1m 43s
B	Prefiquence	800	greedy, two-pointers	31,431	1m 7s	✓
C	Assembly via Remainders	1000	constructive-algorithms, number-theory	29,258	1m 54s
D	Permutation Game	1300	brute-force, dfs-and-similar, games	17,423	1m 22s	✓
E	Cells Arrangement	1600	constructive-algorithms	12,636	1m 34s
F	Equal XOR Segments	1800	binary-search, data-structures	6,926	2m 14s
G1	Division + LCP (easy version)	1900	binary-search, data-structures, dp	5,297	1m 26s	✓
G2	Division + LCP (hard version)	2200	binary-search, brute-force, data-structures	2,507	1m 37s

Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968G2 - Division + LCP (hard version)

We are given a string and asked to split it into a fixed number of contiguous pieces. For any such split, we look at how long a common prefix all pieces share, meaning we compare the first characters of every segment, then the second characters, and so on, stopping at the…

Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968F - Equal XOR Segments

We are asked to decide, for subarrays of a given array, whether it is possible to partition the subarray into at least two consecutive segments such that the bitwise XOR of each segment is equal.

Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968G1 - Division + LCP (easy version)

The problem asks us to split a string into exactly $k$ consecutive substrings and then compute the longest common prefix (LCP) shared among those substrings.

Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968E - Cells Arrangement

We are asked to place exactly $n$ points inside an $n times n$ integer grid. Each point occupies a distinct cell, and we then look at all pairwise Manhattan distances between chosen points.

Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968C - Assembly via Remainders

We are asked to reconstruct an array of integers when only the modular differences between consecutive elements are known.

Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968A - Maximize?

We are given a number $x$, and we need to choose a smaller positive integer $y$ such that the value $$gcd(x, y) + y$$ is as large as possible. The goal is not to maximize $y$ itself, but a combination of $y$ and how much it shares divisors with $x$.

Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968D - Permutation Game

We are given a directed structure formed by a permutation. From each index $x$, there is exactly one outgoing edge to $px$, so the entire system decomposes into disjoint directed cycles, possibly with trees feeding into them, but because $p$ is a permutation, every node lies…

Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968B - Prefiquence

We are asked to find, for each test case, the longest prefix of a binary string a that can appear as a subsequence in another binary string b.