Codeforces Round 236 (Div. 2)

Solutions for Codeforces Round 236 (Div. 2) (contest 402). 1/4 problems verified against sample I/O. Difficulty range: 1100-2200.

4 items

Codeforces Round 236 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 1/4 | Rating range: 1100-2200 | Time: 11m 10s

Problem Name Rating Tags Solve Time Verified
A Nuts 1100 greedy, math 4m 11s ✗
B Trees in a Row 1400 brute-force, implementation 2m 19s ✗
D Upgrading Array 1800 dp, greedy, math 1m 3s ✓
E Strictly Positive Matrix 2200 graphs, math 3m 37s ✗
Practice › Codeforces Solutions › Codeforces Round 236 (Div. 2) ›

CF 402A - Nuts

We are asked to distribute a certain number of nuts into boxes, and we are given a limited number of divisors that can split a box into multiple sections. Each box can have at most k sections, and each section can hold at most v nuts. We have a total nuts and b divisors.
codeforces competitive-programming greedy math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 236 (Div. 2) ›

CF 402B - Trees in a Row

Codeforces 402B: Trees in a Row
codeforces competitive-programming brute-force implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 236 (Div. 2) ›

CF 402D - Upgrading Array

We are given an array of positive integers and a set of "bad" prime numbers. Every other prime not in the bad set is implicitly "good." Each number in the array contributes to a total "beauty" score determined by its prime factorization.
codeforces competitive-programming dp greedy math number-theory May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 236 (Div. 2) ›

CF 402E - Strictly Positive Matrix

We are given a square matrix with non-negative integer entries. You can think of it as a weighted directed graph with n nodes where the entry a[i][j] tells you how strongly node i influences node j.
codeforces competitive-programming graphs math May 29, 2026