Codeforces Round 200 (Div. 1)

5 problems from Codeforces Round 200 (Div. 1) (contest 343), difficulty 1600-2900. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 200 (Div. 1)

Div. 1 | 5 problems | 4/5 verified | Difficulty 1600-2900 | 8m 27s

# Problem Rating Tags Accepted Time ✓
A Rational Resistance 1600 math, number-theory 10,080 1m 17s ✓
B Alternating Current 1600 data-structures, greedy, implementation 17,236 2m 3s ✓
C Read Time 1900 binary-search, greedy, two-pointers 3,212 1m 13s ✓
D Water Tree 2100 data-structures, dfs-and-similar, graphs 6,847 1m 36s ✓
E Pumping Stations 2900 brute-force, dfs-and-similar, divide-and-conquer 911 2m 18s
Practice › Codeforces Solutions › Codeforces Round 200 (Div. 1) ›

CF 343A - Rational Resistance

We are asked to construct a resistor network using only unit resistors to achieve a specific rational resistance $frac{a}{b}$.
codeforces competitive-programming math number-theory Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 200 (Div. 1) ›

CF 343C - Read Time

We are asked to simulate multiple read heads moving along a linear hard drive to read a set of target tracks as quickly as possible. Each head starts at a given track, can move left, right, or stay in place, and multiple heads can occupy the same track.
codeforces competitive-programming binary-search greedy two-pointers Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 200 (Div. 1) ›

CF 343E - Pumping Stations

We are asked to maximize the total amount of water Mike can pump across a network of stations in a sequence of days. Each station is a node in an undirected graph, and pipes between stations are edges with capacities.
codeforces competitive-programming brute-force dfs-and-similar divide-and-conquer flows graphs greedy trees Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 200 (Div. 1) ›

CF 343D - Water Tree

We are given a rooted tree where every node behaves like a reservoir that can either contain water or be empty. The root is fixed at node 1, and all edges are directed conceptually away from it.
codeforces competitive-programming data-structures dfs-and-similar graphs trees Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 200 (Div. 1) ›

CF 343B - Alternating Current

We are given a sequence that describes how two wires, one called “plus” and the other “minus”, overlap as they run from the left side to the right side of a device. At each position along the path, exactly one of the wires is physically above the other.
codeforces competitive-programming data-structures greedy implementation Jun 6, 2026