Codeforces Round 185 (Div. 1)

5 problems from Codeforces Round 185 (Div. 1) (contest 311), difficulty 1300-2600. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 185 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1300-2600 | 7m 5s

# Problem Rating Tags Accepted Time ✓
A The Closest Pair 1300 constructive-algorithms, implementation 4,225 1m 27s
B Cats Transport 2400 data-structures, dp 4,302 56s ✓
C Fetch the Treasure 2500 brute-force, data-structures, graphs 547 1m 7s ✓
D Interval Cubing 2600 data-structures, math 783 1m 33s ✓
E Biologist 2300 flows 1,575 2m 2s
Practice › Codeforces Solutions › Codeforces Round 185 (Div. 1) ›

CF 311E - Biologist

We are asked to maximize the net money SmallR can gain from an experiment on dogs, where she can change each dog’s sex at a given cost.
codeforces competitive-programming flows Jun 5, 2026
Practice › Codeforces Solutions › Codeforces Round 185 (Div. 1) ›

CF 311D - Interval Cubing

We are given an array of integers and a sequence of queries. Each query is either asking for the sum of a subarray or instructing us to cube every element in a subarray. The output consists of the answers to the sum queries, computed modulo 95542721.
codeforces competitive-programming data-structures math Jun 5, 2026
Practice › Codeforces Solutions › Codeforces Round 185 (Div. 1) ›

CF 311A - The Closest Pair

We are given a set of points in a 2D plane. The original geometric task would normally be to compute the smallest Euclidean distance among all pairs of points.
codeforces competitive-programming constructive-algorithms implementation Jun 5, 2026
Practice › Codeforces Solutions › Codeforces Round 185 (Div. 1) ›

CF 311B - Cats Transport

We have a farm with a straight road and several hills numbered from 1 to n. Each hill is separated from the previous one by a known distance. There are m cats, each of which finishes wandering on a particular hill at a certain time, and waits there for a feeder.
codeforces competitive-programming data-structures dp May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 185 (Div. 1) ›

CF 311C - Fetch the Treasure

We have a linear arrangement of h cells, numbered from 1 to h. Some of these cells contain treasures, each with a positive dollar value.
codeforces competitive-programming brute-force data-structures graphs shortest-paths May 29, 2026