Codeforces Round 675 (Div. 2)

Solutions for Codeforces Round 675 (Div. 2) (contest 1422). 4/6 problems verified against sample I/O. Difficulty range: 800-2700.

6 items

Codeforces Round 675 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 4/6 | Rating range: 800-2700 | Time: 18m 10s

Problem Name Rating Tags Solve Time Verified
A Fence 800 geometry, math 1m 47s ✗
B Nice Matrix 1300 greedy, implementation, math 1m 12s ✓
C Bargain 1700 combinatorics, dp, math 8m 18s ✗
D Returning Home 2300 graphs, shortest-paths, sortings 3m 25s ✓
E Minlexes 2700 dp, greedy, implementation 1m 59s ✓
F Boring Queries 2700 data-structures, math, number-theory 1m 29s ✓
Practice › Codeforces Solutions › Codeforces Round 675 (Div. 2) ›

CF 1422C - Bargain

The error you are seeing is not an algorithmic bug. The traceback says: This happens because the test harness is calling a function named solve(), but no such function exists in the submitted code. Python never even reads the input or starts computing shortcuts.
codeforces competitive-programming combinatorics dp math Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 675 (Div. 2) ›

CF 1422F - Boring Queries

We are given a static array of integers, and we are asked to answer many range queries. Each query asks for the least common multiple of all values inside a subsegment of the array.
codeforces competitive-programming data-structures math number-theory Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 675 (Div. 2) ›

CF 1422D - Returning Home

We are moving on an enormous grid. The starting cell is $(sx,sy)$ and the destination is $(fx,fy)$. Walking works normally: moving one cell horizontally or vertically costs one minute, so the cost of walking between two positions is Manhattan distance.
codeforces competitive-programming graphs shortest-paths sortings Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 675 (Div. 2) ›

CF 1422E - Minlexes

We are given a string s consisting of lowercase letters. For each suffix of s, we are asked to compute the lexicographically smallest string that can result after repeatedly removing disjoint pairs of identical consecutive letters.
codeforces competitive-programming dp greedy implementation strings Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 675 (Div. 2) ›

CF 1422A - Fence

The task is to determine a possible length for the fourth side of a quadrilateral when three sides are already given. Each input case provides three integers representing the lengths of three existing fence segments.
codeforces competitive-programming geometry math Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 675 (Div. 2) ›

CF 1422B - Nice Matrix

We are given a rectangular grid of integers of size $n times m$, and we want to transform it into a "nice" matrix. A matrix is nice if every row and every column reads the same forwards and backwards, meaning they are palindromes.
codeforces competitive-programming greedy implementation math Jun 11, 2026