Codeforces Round 1044 (Div. 2)

6 problems from Codeforces Round 1044 (Div. 2) (contest 2133), difficulty 800-3000. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 1044 (Div. 2)

Div. 2 | 6 problems | 1/6 verified | Difficulty 800-3000 | 10m 23s

# Problem Rating Tags Accepted Time ✓
A Redstone? 800 brute-force, data-structures, implementation 30,958 1m 14s ✓
B Villagers 800 greedy 25,515 1m 46s
C The Nether 1400 graphs, interactive 12,790 1m 48s
D Chicken Jockey 1900 dp, greedy 7,481 2m 31s
E I Yearned For The Mines 2500 constructive-algorithms, dfs-and-similar, dp 1,692 1m 34s
F Flint and Steel 3000 data-structures, dp, graphs 466 1m 30s
Practice › Codeforces Solutions › Codeforces Round 1044 (Div. 2) ›

CF 2133D - Chicken Jockey

Working
codeforces competitive-programming dp greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1044 (Div. 2) ›

CF 2133E - I Yearned For The Mines

We are working on a tree where an adversary occupies exactly one node, but we never know which one. The adversary is also reactive: after each of our actions, they are allowed to move along one edge or stay in place, except in the special case where we directly queried their…
codeforces competitive-programming constructive-algorithms dfs-and-similar dp greedy trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1044 (Div. 2) ›

CF 2133F - Flint and Steel

We are given a line of creepers, each with an explosive power. Detonating a creeper at position $i$ kills all creepers within distance less than its explosive power, specifically positions $j$ such that $ The input consists of multiple test cases, each with $n$ creepers and an…
codeforces competitive-programming data-structures dp graphs Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1044 (Div. 2) ›

CF 2133C - The Nether

We are given a network of nether portals represented as a directed acyclic graph. Each portal may have directed connections to other portals, but there are no cycles. The task is to find a longest path in this hidden DAG.
codeforces competitive-programming graphs interactive Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1044 (Div. 2) ›

CF 2133B - Villagers

We are given several independent scenarios. In each scenario, there are $n$ villagers, and each villager starts with a non-negative integer value called grumpiness.
codeforces competitive-programming greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1044 (Div. 2) ›

CF 2133A - Redstone?

We are asked to decide whether a sequence of gears can be arranged in a line such that spinning the leftmost gear at one revolution per second results in the rightmost gear spinning exactly at one revolution per second.
codeforces competitive-programming brute-force data-structures implementation math Jun 8, 2026