Educational Codeforces Round 102 (Rated for Div. 2)

Solutions for Educational Codeforces Round 102 (Rated for Div. 2) (contest 1473). 1/7 problems verified against sample I/O. Difficulty range: 800-2800.

7 items

Educational Codeforces Round 102 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 1/7 | Rating range: 800-2800 | Time: 19m 58s

Problem Name Rating Tags Solve Time Verified
A Replacing Elements 800 greedy, implementation, math 2m 44s ✗
B String LCM 1000 brute-force, math, number-theory 2m 59s ✗
C No More Inversions 1500 constructive-algorithms, math 2m 19s ✗
D Program 1700 data-structures, dp, implementation 1m 46s ✓
E Minimum Path 2400 graphs, shortest-paths 2m 42s ✗
F Strange Set 2700 flows, math 4m 28s ✗
G Tiles 2800 combinatorics, dp, fft 3m ✗
Practice › Codeforces Solutions › Educational Codeforces Round 102 (Rated for Div. 2) ›

CF 1473G - Tiles

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 combinatorics dp fft math Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 102 (Rated for Div. 2) ›

CF 1473F - Strange Set

We are selecting a subset of indices from an array of size $n$, and each index has a value $bi$ that contributes to a total score. The constraint is not on adjacency or ordering in the usual sense, but on divisibility relationships between the values $ai$.
codeforces competitive-programming flows math Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 102 (Rated for Div. 2) ›

CF 1473A - Replacing Elements

We are given an array of positive integers and a threshold value, $d$. In one operation, we can pick any element and replace it with the sum of any two other distinct elements.
codeforces competitive-programming greedy implementation math sortings Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 102 (Rated for Div. 2) ›

CF 1473E - Minimum Path

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 graphs shortest-paths Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 102 (Rated for Div. 2) ›

CF 1473D - Program

We are given a program that manipulates a single integer variable x, starting from 0. Each instruction either increments or decrements x by 1.
codeforces competitive-programming data-structures dp implementation strings Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 102 (Rated for Div. 2) ›

CF 1473B - String LCM

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 brute-force math number-theory strings Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 102 (Rated for Div. 2) ›

CF 1473C - No More Inversions

We start with a fixed base array that goes up from 1 to k and then comes back down in a truncated way so that its length becomes n. This shape is a single peak: it strictly increases to k, then strictly decreases.
codeforces competitive-programming constructive-algorithms math Jun 11, 2026