Codeforces Round 202 (Div. 1)

5 problems from Codeforces Round 202 (Div. 1) (contest 348), difficulty 1600-2800. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 202 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1600-2800 | 8m 22s

# Problem Rating Tags Accepted Time ✓
A Mafia 1600 binary-search, math, sortings 14,681 2m 11s
B Apple Tree 2100 dfs-and-similar, number-theory, trees 2,283 1m 30s
C Subset Sums 2500 brute-force, data-structures 2,741 1m 4s ✓
D Turtles 2500 dp, matrices 2,217 2m 5s
E Pilgrims 2800 dfs-and-similar, dp, trees 512 1m 32s ✓
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 1) ›

CF 348C - Subset Sums

We are given an array of integers and a collection of subsets, each referencing indices in the array. Two types of operations are performed repeatedly: querying the sum of the elements of a subset, and adding a value to all elements of a subset.
codeforces competitive-programming brute-force data-structures Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 1) ›

CF 348B - Apple Tree

We are given a rooted tree where only the leaves initially contain apples, while internal nodes are empty. Each leaf contributes a fixed number of apples, and the “weight” of any subtree is defined as the total number of apples in all leaves inside that subtree.
codeforces competitive-programming dfs-and-similar number-theory trees Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 1) ›

CF 348E - Pilgrims

We are given a weighted tree with n towns. Some of these towns contain monasteries, and each monastery hosts exactly one pilgrim.
codeforces competitive-programming dfs-and-similar dp trees Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 1) ›

CF 348D - Turtles

We are given a rectangular grid of size n by m, where each cell is either free or blocked. Two turtles start at the top-left corner, cell (1,1), and both want to reach the bottom-right corner, cell (n,m).
codeforces competitive-programming dp matrices Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 1) ›

CF 348A - Mafia

We are given a group of friends who will repeatedly play a game. Each round of the game has exactly one person acting as a supervisor, while the remaining $n-1$ people participate as players.
codeforces competitive-programming binary-search math sortings Jun 6, 2026