Codeforces Round 282 (Div. 1)

Solutions for Codeforces Round 282 (Div. 1) (contest 494). 1/4 problems verified against sample I/O. Difficulty range: 2000-3200.

4 items

Codeforces Round 282 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 1/4 | Rating range: 2000-3200 | Time: 24m 13s

Problem Name Rating Tags Solve Time Verified
B Obsessive String 2000 dp, strings 10m 58s ✗
C Helping People 2600 dp, probabilities 42s ✓
D Birthday 2700 data-structures, dfs-and-similar, dp 1m 4s ✗
E Sharti 3200 data-structures, games 11m 29s ✗
Practice › Codeforces Solutions › Codeforces Round 282 (Div. 1) ›

CF 494B - Obsessive String

We are given two strings, s and t. Our goal is to count the number of ways to select one or more non-overlapping substrings from s such that each selected substring contains t somewhere inside it.
codeforces competitive-programming dp strings May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 282 (Div. 1) ›

CF 494C - Helping People

We are tasked with calculating the expected maximum wealth of a group of people after a series of charitable recommendations. Each person starts with a known amount of money.
codeforces competitive-programming dp probabilities May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 282 (Div. 1) ›

CF 494D - Birthday

We are given a weighted tree with n vertices rooted at vertex 1. Each edge has a positive weight. For any vertex v, we define a set S(v) containing all descendants of v (including itself) such that the distance from the root to a vertex u in S(v) equals the distance from the…
codeforces competitive-programming data-structures dfs-and-similar dp trees May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 282 (Div. 1) ›

CF 494E - Sharti

The board is enormous, up to $10^9 times 10^9$, so we never have any chance of working with cells directly. A move chooses a square of side length at most $k$. The lower-right corner of that square must currently be white. Every cell inside the square is flipped.
codeforces competitive-programming data-structures games May 31, 2026