Codeforces Round 281 (Div. 2)

Solutions for Codeforces Round 281 (Div. 2) (contest 493). 3/5 problems verified against sample I/O. Difficulty range: 1300-2800.

5 items

Codeforces Round 281 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1300-2800 | Time: 16m 6s

Problem Name Rating Tags Solve Time Verified
A Vasya and Football 1300 implementation 1m 38s ✓
B Vasya and Wrestling 1400 implementation 10m 54s ✗
C Vasya and Basketball 1600 binary-search, brute-force, data-structures 54s ✓
D Vasya and Chess 1700 constructive-algorithms, games, math 1m 25s ✓
E Vasya and Polynomial 2800 math 1m 15s ✗
Practice › Codeforces Solutions › Codeforces Round 281 (Div. 2) ›

CF 493A - Vasya and Football

We are given the names of the home and away teams, followed by a chronological list of card events during a football match. Each event specifies the minute, which team the player belongs to, the player's jersey number, and whether the referee gives a yellow card or a red card.
codeforces competitive-programming implementation May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 281 (Div. 2) ›

CF 493B - Vasya and Wrestling

We are given a chronological log of wrestling techniques. Each entry is an integer that describes both who performed the move and how many points it contributed.
codeforces competitive-programming implementation May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 281 (Div. 2) ›

CF 493C - Vasya and Basketball

Vasya wants to maximize the point advantage of his team in a basketball game by choosing a threshold distance, d, that separates 2-point throws from 3-point throws. Each team has a list of distances from which they made successful throws.
codeforces competitive-programming binary-search brute-force data-structures implementation sortings two-pointers May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 281 (Div. 2) ›

CF 493D - Vasya and Chess

We have an $n times n$ board. The white queen starts at the top-left corner $(1,1)$, and the black queen starts at the top-right corner $(1,n)$. Every other square contains a green pawn. A move is mandatory. On each turn, a player must capture some piece with their queen.
codeforces competitive-programming constructive-algorithms games math May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 281 (Div. 2) ›

CF 493E - Vasya and Polynomial

We are asked to count the number of polynomials with non-negative integer coefficients that satisfy a very specific evaluation property.
codeforces competitive-programming math May 31, 2026