Codeforces Round 281 (Div. 2)

5 problems from Codeforces Round 281 (Div. 2) (contest 493), difficulty 1300-2800. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 281 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 1300-2800 | 16m 6s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Vasya and Football	1300	implementation	6,448	1m 38s	✓
B	Vasya and Wrestling	1400	implementation	14,068	10m 54s
C	Vasya and Basketball	1600	binary-search, brute-force, data-structures	7,504	54s	✓
D	Vasya and Chess	1700	constructive-algorithms, games, math	10,199	1m 25s	✓
E	Vasya and Polynomial	2800	math	517	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.

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.

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.

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.

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.