Codeforces Round 165 (Div. 1)

5 problems from Codeforces Round 165 (Div. 1) (contest 269), difficulty 1600-3100. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 165 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1600-3100 | 8m 33s

# Problem Rating Tags Accepted Time ✓
A Magical Boxes 1600 greedy, math 3,699 1m 42s ✓
B Greenhouse Effect 1700 dp 6,989 1m 38s ✓
C Flawed Flow 2100 constructive-algorithms, flows, graphs 1,818 1m 14s ✓
D Maximum Waterfall 2600 data-structures, dp, graphs 493 2m 57s
E String Theory 3100 geometry, math, strings 118 1m 2s
Practice › Codeforces Solutions › Codeforces Round 165 (Div. 1) ›

CF 269A - Magical Boxes

We are asked to determine the size of the smallest magical box that can contain a given set of smaller boxes. Each box has a side length that is a power of two, specifically 2^k for some integer k.
codeforces competitive-programming greedy math Jun 5, 2026
Practice › Codeforces Solutions › Codeforces Round 165 (Div. 1) ›

CF 269B - Greenhouse Effect

We are given a sequence of plants positioned along a line, each plant belonging to one of m species. The greenhouse is long but narrow, so each plant has a unique position along this line, and all positions are strictly increasing.
codeforces competitive-programming dp Jun 5, 2026
Practice › Codeforces Solutions › Codeforces Round 165 (Div. 1) ›

CF 269E - String Theory

I can't reliably produce a correct editorial and accepted reference solution for Codeforces 269E from the problem statement alone.
codeforces competitive-programming geometry math strings Jun 5, 2026
Practice › Codeforces Solutions › Codeforces Round 165 (Div. 1) ›

CF 269D - Maximum Waterfall

We have a set of horizontal panels attached to a wall. Water starts from the artificial "top panel" at height t and must eventually reach the artificial "bottom panel" at height 0.
codeforces competitive-programming data-structures dp graphs sortings Jun 5, 2026
Practice › Codeforces Solutions › Codeforces Round 165 (Div. 1) ›

CF 269C - Flawed Flow

We are given an undirected connected graph with n vertices and m edges, where each edge has a flow value already assigned. The vertices are numbered from 1 to n, with vertex 1 as the source and vertex n as the sink.
codeforces competitive-programming constructive-algorithms flows graphs greedy Jun 5, 2026