Codeforces Beta Round 2

3 problems from Codeforces Beta Round 2 (contest 2), difficulty 1500-2600. 2/3 solutions verified against sample I/O.

3 items

Codeforces Beta Round 2

Beta | 3 problems | 2/3 verified | Difficulty 1500-2600 | 5m 52s

# Problem Rating Tags Accepted Time ✓
A Winner 1500 hashing, implementation 31,213 1m 9s ✓
B The least round way 2000 dp, math 12,942 3m 7s
C Commentator problem 2600 geometry 2,023 1m 36s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 2 ›

CF 2A - Winner

The game records a sequence of rounds. In each round, one player either gains or loses some number of points. At the end, the player with the highest total score should win.
codeforces competitive-programming hashing implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 2 ›

CF 2B - The least round way

We have an n × n grid of non-negative integers. Starting from the top-left corner, we may move only right or down until we reach the bottom-right corner. Along a chosen path, we multiply every visited value together.
codeforces competitive-programming dp math May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 2 ›

CF 2C - Commentator problem

We are given three circles on the plane. Each circle represents a stadium, with a center point and a radius. We need to find a point from which all three stadiums are seen under the same angle.
codeforces competitive-programming geometry May 28, 2026