Educational Codeforces Round 154 (Rated for Div. 2)

Solutions for Educational Codeforces Round 154 (Rated for Div. 2) (contest 1861). 0/6 problems verified against sample I/O. Difficulty range: 800-3200.

6 items

Educational Codeforces Round 154 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 0/6 | Rating range: 800-3200 | Time: 13m 36s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Prime Deletion	800	constructive-algorithms, math	1m 53s	✗
B	Two Binary Strings	1000	constructive-algorithms, dp, greedy	2m 40s	✗
C	Queries for the Array	1600	data-structures, dfs-and-similar, implementation	3m 16s	✗
D	Sorting By Multiplication	1800	dp, greedy	2m 22s	✗
E	Non-Intersecting Subpermutations	2300	combinatorics, dp, implementation	1m 39s	✗
F	Four Suits	3200	binary-search, bitmasks, flows	1m 46s	✗

Practice › Codeforces Solutions › Educational Codeforces Round 154 (Rated for Div. 2) ›

CF 1861F - Four Suits

In this problem, we have a card game with multiple players and a dealer. Each card belongs to one of four suits. The dealer has already partially dealt cards to players, and some cards remain in the deck.

Practice › Codeforces Solutions › Educational Codeforces Round 154 (Rated for Div. 2) ›

CF 1861E - Non-Intersecting Subpermutations

We are asked to consider arrays of length n filled with integers from 1 to k. The "cost" of an array is defined as the maximum number of contiguous subarrays of length exactly k where each subarray contains all integers from 1 to k exactly once, and no element participates in…

Practice › Codeforces Solutions › Educational Codeforces Round 154 (Rated for Div. 2) ›

CF 1861D - Sorting By Multiplication

We are given an array of positive integers, and our task is to transform it into a strictly increasing sequence using the fewest operations.

Practice › Codeforces Solutions › Educational Codeforces Round 154 (Rated for Div. 2) ›

CF 1861C - Queries for the Array

We are asked to check whether a given sequence of symbols could have been produced by operations on an array that starts empty.

Practice › Codeforces Solutions › Educational Codeforces Round 154 (Rated for Div. 2) ›

CF 1861B - Two Binary Strings

We are given two binary strings of equal length. Both strings always start with a 0 and end with a 1. We are allowed to repeatedly apply an operation that takes a segment inside one string, provided the endpoints of that segment contain the same character, and then forces…

Practice › Codeforces Solutions › Educational Codeforces Round 154 (Rated for Div. 2) ›

CF 1861A - Prime Deletion

We start with a fixed multiset of digits from 1 to 9, each appearing exactly once, written in a row. The only operation allowed is deleting digits one by one, with the restriction that we are not allowed to delete when only two digits remain in the current sequence.