Codeforces Round 667 (Div. 3)

Solutions for Codeforces Round 667 (Div. 3) (contest 1409). 4/6 problems verified against sample I/O. Difficulty range: 800-2100.

6 items

Codeforces Round 667 (Div. 3)

Type: Div. 3 | Problems: 6 | Verified: 4/6 | Rating range: 800-2100 | Time: 13m 57s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Yet Another Two Integers Problem	800	greedy, math	1m 30s	✗
B	Minimum Product	1100	brute-force, greedy, math	1m 46s	✓
C	Yet Another Array Restoration	1200	brute-force, math, number-theory	7m 3s	✗
D	Decrease the Sum of Digits	1500	greedy, math	1m 4s	✓
E	Two Platforms	1800	binary-search, dp, sortings	1m 19s	✓
F	Subsequences of Length Two	2100	dp, strings	1m 15s	✓

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

CF 1409C - Yet Another Array Restoration

The root cause of the failure here is the test harness is trying to call a solve() function that isn’t defined in the same context.

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

CF 1409F - Subsequences of Length Two

We are given a base string and a target string of length two. We are allowed to change at most k characters in the base string, replacing any position with any lowercase letter.

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

CF 1409E - Two Platforms

We are given a set of points on a 2D plane, each with coordinates $(xi, yi)$, and two horizontal platforms of fixed length $k$. The platforms can be positioned anywhere along the $x$-axis at any $y$-coordinate, but they must remain horizontal.

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

CF 1409D - Decrease the Sum of Digits

We are given a large integer and a threshold on the sum of its digits. In a single operation we are allowed to increment the number by one, and we want to know how many increments are needed until the digit sum of the resulting number becomes small enough, specifically at most…

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

CF 1409B - Minimum Product

We start with two numbers, a and b. We are allowed to perform at most n decrement operations. Each operation decreases either a or b by exactly one. The catch is that a can never go below x, and b can never go below y.

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

CF 1409A - Yet Another Two Integers Problem

We are given two integers, and we want to transform the first into the second using a sequence of moves. Each move allows us to pick any integer step size from 1 to 10 and either add it to or subtract it from the current value.