Educational Codeforces Round 103 (Rated for Div. 2)

Solutions for Educational Codeforces Round 103 (Rated for Div. 2) (contest 1476). 3/7 problems verified against sample I/O. Difficulty range: 1000-3100.

7 items

Educational Codeforces Round 103 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 3/7 | Rating range: 1000-3100 | Time: 20m 56s

Problem Name Rating Tags Solve Time Verified
A K-divisible Sum 1000 binary-search, constructive-algorithms, greedy 3m 40s ✓
B Inflation 1300 binary-search, brute-force, greedy 1m 47s ✓
C Longest Simple Cycle 1600 dp, graphs, greedy 2m 52s ✗
D Journey 1700 dfs-and-similar, dp, dsu 3m 17s ✗
E Pattern Matching 2300 bitmasks, data-structures, dfs-and-similar 2m 53s ✗
F Lanterns 3000 binary-search, data-structures, dp 4m 36s ✗
G Minimum Difference 3100 data-structures, hashing, sortings 1m 51s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 103 (Rated for Div. 2) ›

CF 1476F - Lanterns

We are given a row of lanterns, each with a power that determines how many consecutive lanterns it can illuminate in either direction. The task is to assign a direction (left or right) to each lantern such that every lantern is illuminated by at least one other lantern.
codeforces competitive-programming binary-search data-structures dp Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 103 (Rated for Div. 2) ›

CF 1476G - Minimum Difference

We are working with an array of integers where we need to handle two types of operations efficiently. The first operation asks, for a given subarray, to select exactly k distinct numbers whose frequencies are as balanced as possible, minimizing the largest difference between…
codeforces competitive-programming data-structures hashing sortings two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 103 (Rated for Div. 2) ›

CF 1476E - Pattern Matching

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming bitmasks data-structures dfs-and-similar graphs hashing sortings strings Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 103 (Rated for Div. 2) ›

CF 1476D - Journey

We are given a chain of cities numbered from 0 to $n$, connected linearly by $n$ roads. Each road has a direction, either left (from city $i$ to $i-1$) or right (from $i-1$ to $i$). A traveler wants to start from some city and visit as many distinct cities as possible.
codeforces competitive-programming dfs-and-similar dp dsu implementation Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 103 (Rated for Div. 2) ›

CF 1476A - K-divisible Sum

We are asked to construct an array of size $n$ containing positive integers such that the sum of all elements is divisible by $k$. Among all arrays that satisfy this condition, we need the one where the largest element is as small as possible.
codeforces competitive-programming binary-search constructive-algorithms greedy math Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 103 (Rated for Div. 2) ›

CF 1476C - Longest Simple Cycle

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming dp graphs greedy Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 103 (Rated for Div. 2) ›

CF 1476B - Inflation

We are given a sequence of monthly price increases for a single product. The first value represents the initial price, and each subsequent value is the nominal increase in that month.
codeforces competitive-programming binary-search brute-force greedy math Jun 10, 2026