Codeforces Round 203 (Div. 2)

Solutions for Codeforces Round 203 (Div. 2) (contest 350). 1/4 problems verified against sample I/O. Difficulty range: 1200-2200.

4 items

Codeforces Round 203 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 1/4 | Rating range: 1200-2200 | Time: 17m 31s

Problem Name Rating Tags Solve Time Verified
A TL 1200 brute-force, greedy, implementation 6m 57s ✗
B Resort 1500 graphs 4m 28s ✗
C Bombs 1600 greedy, implementation, sortings 3m 48s ✓
E Wrong Floyd 2200 brute-force, constructive-algorithms, dfs-and-similar 2m 18s ✗
Practice › Codeforces Solutions › Codeforces Round 203 (Div. 2) ›

CF 350A - TL

Codeforces 350A: TL
codeforces competitive-programming brute-force greedy implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 203 (Div. 2) ›

CF 350B - Resort

We are given a directed structure on n objects representing a ski resort. Each object is either a mountain or a hotel. Every object has at most one outgoing ski track leading to another object, and a hotel never has outgoing tracks at all.
codeforces competitive-programming graphs May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 203 (Div. 2) ›

CF 350C - Bombs

We have a robot starting at the origin on a 2D grid. Several bombs are placed at distinct coordinates, and the robot must destroy all of them.
codeforces competitive-programming greedy implementation sortings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 203 (Div. 2) ›

CF 350E - Wrong Floyd

We are given an undirected, simple, connected graph with a fixed number of vertices and edges. On top of that, a subset of vertices is marked.
codeforces competitive-programming brute-force constructive-algorithms dfs-and-similar graphs May 29, 2026