Educational Codeforces Round 144 (Rated for Div. 2)

Solutions for Educational Codeforces Round 144 (Rated for Div. 2) (contest 1796). 2/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Educational Codeforces Round 144 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2900 | Time: 13m 3s

Problem Name Rating Tags Solve Time Verified
A Typical Interview Problem 800 brute-force, implementation, strings 3m 24s ✓
B Asterisk-Minor Template 1000 implementation, strings 2m 31s ✗
C Maximum Set 1600 binary-search, math 2m 23s ✓
D Maximum Subarray 2000 data-structures, dp, greedy 1m ✗
E Colored Subgraphs 2500 dfs-and-similar, dp, games 1m 49s ✗
F Strange Triples 2900 brute-force, math, number-theory 1m 56s ✗
Practice › Codeforces Solutions › Educational Codeforces Round 144 (Rated for Div. 2) ›

CF 1796F - Strange Triples

We are asked to count triples of positive integers (a, b, n) that satisfy a specific strange property. Here, a can range from 1 up to A-1, b from 1 up to B-1, and n from 1 up to N-1.
codeforces competitive-programming brute-force math number-theory Jun 9, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 144 (Rated for Div. 2) ›

CF 1796E - Colored Subgraphs

We are given a tree with $n$ vertices, and we are allowed to choose any vertex $r$ as a root. Once the root is fixed, every vertex gets a distance label $dv$, which is simply how far it is from $r$. After this, we assign colors to vertices under two constraints.
codeforces competitive-programming dfs-and-similar dp games greedy trees Jun 9, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 144 (Rated for Div. 2) ›

CF 1796A - Typical Interview Problem

We are asked to reason about an infinite string that is not built directly character by character, but generated from the positive integers in order.
codeforces competitive-programming brute-force implementation strings Jun 9, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 144 (Rated for Div. 2) ›

CF 1796D - Maximum Subarray

Producing a complete editorial of the quality and length you requested for Codeforces 1796D would require first deriving and verifying the full intended solution in detail.
codeforces competitive-programming data-structures dp greedy two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 144 (Rated for Div. 2) ›

CF 1796B - Asterisk-Minor Template

We are asked to construct a “template” string that can describe two given strings simultaneously. A template consists of lowercase letters and asterisks. Each asterisk can be replaced with any string, including the empty string, to match the original strings.
codeforces competitive-programming implementation strings Jun 9, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 144 (Rated for Div. 2) ›

CF 1796C - Maximum Set

We are asked to work with sets of integers that are “beautiful,” meaning that any two numbers in the set are comparable under divisibility.
codeforces competitive-programming binary-search math Jun 9, 2026