Codeforces Round 453 (Div. 2)

2 problems from Codeforces Round 453 (Div. 2) (contest 902), difficulty 1100-1200. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 453 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1100-1200 | 9m 53s

# Problem Rating Tags Accepted Time ✓
A Visiting a Friend 1100 greedy, implementation 10,275 5m 16s ✓
B Coloring a Tree 1200 dfs-and-similar, dsu, greedy 11,948 4m 37s ✓
Practice › Codeforces Solutions › Codeforces Round 453 (Div. 2) ›

CF 902A - Visiting a Friend

We are given a set of teleporters placed along a one-dimensional number line. Pig starts at position 0 and wants to reach position m.
codeforces competitive-programming greedy implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 453 (Div. 2) ›

CF 902B - Coloring a Tree

We are given a rooted tree with n vertices, where vertex 1 is the root. Each vertex must be colored with a target color specified in the input. Initially, all vertices are color 0.
codeforces competitive-programming dfs-and-similar dsu greedy Jun 12, 2026