Codeforces Round 269 (Div. 2)

Solutions for Codeforces Round 269 (Div. 2) (contest 471). 3/5 problems verified against sample I/O. Difficulty range: 1100-2700.

5 items

Codeforces Round 269 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1100-2700 | Time: 8m 43s

Problem Name Rating Tags Solve Time Verified
A MUH and Sticks 1100 implementation 1m 21s ✓
B MUH and Important Things 1300 implementation, sortings 1m 41s ✗
C MUH and House of Cards 1700 binary-search, brute-force, greedy 1m 42s ✓
D MUH and Cube Walls 1800 string-suffix-structures, strings 1m 58s ✓
E MUH and Lots and Lots of Segments 2700 data-structures, dsu 2m 1s ✗
Practice › Codeforces Solutions › Codeforces Round 269 (Div. 2) ›

CF 471A - MUH and Sticks

We are given exactly six stick lengths. To build an animal, four of the sticks must be used as legs, which means those four sticks must all have the same length. After choosing the four leg sticks, two sticks remain. These determine the animal type.
codeforces competitive-programming implementation May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 269 (Div. 2) ›

CF 471B - MUH and Important Things

We are given a list of tasks, each with an associated difficulty level, and we need to produce three different sequences in which all tasks are completed. Each sequence must respect the rule that tasks can only be reordered if their difficulties are equal.
codeforces competitive-programming implementation sortings May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 269 (Div. 2) ›

CF 471C - MUH and House of Cards

A house of cards is built from floors. If a floor contains k rooms, then each room uses two leaning cards, so the rooms themselves consume 2k cards. Between adjacent rooms and above the outermost rooms there is a ceiling made of horizontal cards.
codeforces competitive-programming binary-search brute-force greedy math May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 269 (Div. 2) ›

CF 471D - MUH and Cube Walls

We have two walls represented by sequences of tower heights. The bears' wall contains n towers, while Horace's wall contains w towers. Horace is allowed to shift his entire wall vertically by any amount.
codeforces competitive-programming string-suffix-structures strings May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 269 (Div. 2) ›

CF 471E - MUH and Lots and Lots of Segments

We start with a collection of axis-aligned segments. Every segment is either horizontal or vertical, and segments of the same orientation never overlap. We are allowed to delete whole segments or only parts of them.
codeforces competitive-programming data-structures dsu May 30, 2026