Codeforces Round 265 (Div. 1)

5 problems from Codeforces Round 265 (Div. 1) (contest 464), difficulty 1700-3000. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 265 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1700-3000 | 8m 25s

# Problem Rating Tags Accepted Time ✓
A No to Palindromes! 1700 greedy, strings 6,235 2m ✓
B Restore Cube 2000 brute-force, geometry 1,782 2m 45s
C Substitutes in Number 2100 dp 1,952 1m 15s ✓
D World of Darkraft - 2 2700 dp, probabilities 757 1m 5s
E The Classic Problem 3000 data-structures, graphs, shortest-paths 1,844 1m 20s ✓
Practice › Codeforces Solutions › Codeforces Round 265 (Div. 1) ›

CF 464E - The Classic Problem

We are given an undirected weighted graph with up to 100,000 vertices and 100,000 edges. Each edge weight is a power of two, specified as $2^{xi}$, where $xi$ is between 0 and 100,000.
codeforces competitive-programming data-structures graphs shortest-paths Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 265 (Div. 1) ›

CF 464B - Restore Cube

We are given eight points in three-dimensional space. Each point was originally a vertex of a cube whose side length was positive. The complication is that the coordinates have been corrupted in a very specific way.
codeforces competitive-programming brute-force geometry Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 265 (Div. 1) ›

CF 464D - World of Darkraft - 2

Working
codeforces competitive-programming dp probabilities Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 265 (Div. 1) ›

CF 464A - No to Palindromes!

We are given a string s of length n consisting of lowercase letters, and an integer p representing the number of allowed letters from the start of the alphabet, that is, 'a' through chr(ord('a') + p - 1).
codeforces competitive-programming greedy strings Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 265 (Div. 1) ›

CF 464C - Substitutes in Number

We start with a decimal string s. Then a sequence of replacement rules is applied in order. Each rule has the form d - t, meaning every occurrence of digit d is replaced by the string t.
codeforces competitive-programming dp Jun 7, 2026