Codeforces Round 202 (Div. 1)

Solutions for Codeforces Round 202 (Div. 1) (contest 348). 1/3 problems verified against sample I/O. Difficulty range: 1600-2800.

3 items

Codeforces Round 202 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 1/3 | Rating range: 1600-2800 | Time: 8m 10s

Problem Name Rating Tags Solve Time Verified
A Mafia 1600 binary-search, math, sortings 4m 1s ✓
D Turtles 2500 dp, matrices 2m 37s ✗
E Pilgrims 2800 dfs-and-similar, dp, trees 1m 32s ✗
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 1) ›

CF 348A - Mafia

We are given a group of n friends who want to play multiple rounds of Mafia, but in each round only one person acts as the supervisor while the remaining n−1 players participate as regular players.
codeforces competitive-programming binary-search math sortings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 1) ›

CF 348D - Turtles

The task is to find the number of ways two turtles can move from the top-left corner of a grid to the bottom-right corner without meeting along the way, except at the start and the end. The grid has cells that are either free or blocked.
codeforces competitive-programming dp matrices May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 1) ›

CF 348E - Pilgrims

We are
codeforces competitive-programming dfs-and-similar dp trees May 29, 2026