Codeforces Round 570 (Div. 3)

Solutions for Codeforces Round 570 (Div. 3) (contest 1183). 7/8 problems verified against sample I/O. Difficulty range: 800-2100.

8 items

Codeforces Round 570 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 7/8 | Rating range: 800-2100 | Time: 36m 3s

Problem Name Rating Tags Solve Time Verified
A Nearest Interesting Number 800 implementation 1m 17s ✓
B Equalize Prices 900 math 9m 40s ✗
C Computer Game 1400 binary-search, math 7m 29s ✓
D Candy Box (easy version) 1400 greedy, sortings 2m 22s ✓
E Subsequences (easy version) 2000 dp, graphs, implementation 1m 40s ✓
F Topforces Strikes Back 2100 brute-force, math, sortings 4m 25s ✓
G Candy Box (hard version) 2000 greedy, implementation, sortings 4m 31s ✓
H Subsequences (hard version) 1900 dp, strings 4m 39s ✓
Practice › Codeforces Solutions › Codeforces Round 570 (Div. 3) ›

CF 1183H - Subsequences (hard version)

We are given a string and we want to construct a collection of distinct strings, where each string must be a subsequence of the original.
codeforces competitive-programming dp strings Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 570 (Div. 3) ›

CF 1183G - Candy Box (hard version)

Each candy belongs to a type. For every type, we know how many candies of that type exist, and among those candies how many have f = 1. We want to build a gift by selecting some candies.
codeforces competitive-programming greedy implementation sortings Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 570 (Div. 3) ›

CF 1183B - Equalize Prices

We are given several independent scenarios. In each one, there is a list of product prices, and we are allowed to adjust each price by at most k in either direction, but we are not allowed to adjust it more than once.
codeforces competitive-programming math Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 570 (Div. 3) ›

CF 1183C - Computer Game

We are simulating a sequence of exactly $n$ game turns. At any moment Vova has a battery charge $k$, and each turn he must choose one of two actions that reduce the charge. One action is cheaper in terms of battery loss but can only be used when the battery is sufficiently high.
codeforces competitive-programming binary-search math Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 570 (Div. 3) ›

CF 1183F - Topforces Strikes Back

We are given several independent datasets. In each dataset there is a multiset of positive integers, where each integer represents the “value” of a problem.
codeforces competitive-programming brute-force math sortings Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 570 (Div. 3) ›

CF 1183D - Candy Box (easy version)

We are given several independent candy collections. Each collection is just a multiset of integers, where each integer represents a candy type. From each collection, we want to build a single “gift” by selecting some candies.
codeforces competitive-programming greedy sortings Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 570 (Div. 3) ›

CF 1183E - Subsequences (easy version)

We start with a string and want to build a set containing exactly k distinct subsequences. Adding a subsequence of length L costs the number of removed characters, which is n - L. The same subsequence cannot be added twice.
codeforces competitive-programming dp graphs implementation shortest-paths Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 570 (Div. 3) ›

CF 1183A - Nearest Interesting Number

We are given a positive integer and we want to find the smallest integer that is not smaller than it such that the sum of its digits is divisible by 4.
codeforces competitive-programming implementation Jun 12, 2026