Codeforces Round 741 (Div. 2)

Solutions for Codeforces Round 741 (Div. 2) (contest 1562). 1/7 problems verified against sample I/O. Difficulty range: 800-2900.

7 items

Codeforces Round 741 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 1/7 | Rating range: 800-2900 | Time: 18m 31s

Problem	Name	Rating	Tags	Solve Time	Verified
A	The Miracle and the Sleeper	800	greedy, math	3m 4s	✗
B	Scenes From a Memory	1000	brute-force, constructive-algorithms, implementation	2m 35s	✓
C	Rings	1500	constructive-algorithms, math	1m 45s	✗
D1	Two Hundred Twenty One (easy version)	1700	data-structures, dp, math	59s	✗
D2	Two Hundred Twenty One (hard version)	2200	data-structures, math	3m 47s	✗
E	Rescue Niwen!	2500	dp, greedy, string-suffix-structures	2m 57s	✗
F	Tubular Bells	2900	interactive, math, number-theory	3m 24s	✗

Practice › Codeforces Solutions › Codeforces Round 741 (Div. 2) ›

CF 1562F - Tubular Bells

We are given a hidden permutation of integers that forms a contiguous interval, but the endpoints of that interval are unknown. Each position in the permutation stores a distinct integer, and together they cover every value in some range of length $n$.

Practice › Codeforces Solutions › Codeforces Round 741 (Div. 2) ›

CF 1562D2 - Two Hundred Twenty One (hard version)

We are given a binary sequence where each position has a value either +1 or -1. A query gives a segment of this sequence, and we are allowed to delete elements from that segment.

Practice › Codeforces Solutions › Codeforces Round 741 (Div. 2) ›

CF 1562E - Rescue Niwen!

Program M computes a double-precision product by expanding each normalized operand into high and low halves, forming four partial products, then discarding all terms that lie strictly to the right of the retained word boundary.

Practice › Codeforces Solutions › Codeforces Round 741 (Div. 2) ›

CF 1562A - The Miracle and the Sleeper

The task asks us to maximize the remainder when one integer divides another, given a range of integers. Specifically, we have two integers, l and r, and we can choose any pair (a, b) such that b is at least l and at most a, and a is at most r.

Practice › Codeforces Solutions › Codeforces Round 741 (Div. 2) ›

CF 1562D1 - Two Hundred Twenty One (easy version)

The proposed solution does not address the actual content of the TAOCP exercise. The exercise is about constructing and explaining numerical instability in floating point evaluation of algebraically equivalent expressions, but the “solution” instead discusses Python…

Practice › Codeforces Solutions › Codeforces Round 741 (Div. 2) ›

CF 1562B - Scenes From a Memory

We are given a number n without zeros in its decimal representation, and the task is to remove some digits to obtain a number that is not prime, either a composite number or 1. The goal is to remove as many digits as possible while still ensuring the result is not prime.

Practice › Codeforces Solutions › Codeforces Round 741 (Div. 2) ›

CF 1562C - Rings

We are given a binary string representing a sequence of rings, where each character is either 0 or 1. Any contiguous segment of this string can be interpreted as a binary number, and its value is obtained in the usual way: reading left to right, shifting previous value by one…