Codeforces Round 188 (Div. 1)

Solutions for Codeforces Round 188 (Div. 1) (contest 317). 3/3 problems verified against sample I/O. Difficulty range: 2300-3100.

3 items

Codeforces Round 188 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 3/3 | Rating range: 2300-3100 | Time: 5m 58s

Problem Name Rating Tags Solve Time Verified
C Balance 2500 constructive-algorithms, dfs-and-similar, graphs 2m 14s ✓
D Game with Powers 2300 dp, games 1m 58s ✓
E Princess and Her Shadow 3100 constructive-algorithms, shortest-paths 1m 46s ✓
Practice › Codeforces Solutions › Codeforces Round 188 (Div. 1) ›

CF 317C - Balance

We are given a network of containers, each holding some amount of water, and a set of bidirectional pipes connecting them.
codeforces competitive-programming constructive-algorithms dfs-and-similar graphs trees May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 188 (Div. 1) ›

CF 317D - Game with Powers

We are asked to determine the winner of a two-player game involving numbers from 1 to n. The players, Vasya and Petya, take turns picking numbers. Once a number x is chosen, neither x nor any of its higher integer powers (x², x³, …) can be chosen in future turns.
codeforces competitive-programming dp games May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 188 (Div. 1) ›

CF 317E - Princess and Her Shadow

We are asked to simulate a chase on a two-dimensional grid between Princess Vlada and her playful Shadow. The grid is infinite but sparse trees are present, which act as obstacles. Both the Princess and Shadow start at distinct integer coordinates.
codeforces competitive-programming constructive-algorithms shortest-paths May 29, 2026