Codeforces Round 536 (Div. 2)

5 problems from Codeforces Round 536 (Div. 2) (contest 1106), difficulty 800-2400. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 536 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 800-2400 | 20m 36s

# Problem Rating Tags Accepted Time ✓
A Lunar New Year and Cross Counting 800 implementation 12,864 4m 34s ✓
C Lunar New Year and Number Division 900 greedy, implementation, math 15,906 1m 15s ✓
D Lunar New Year and a Wander 1500 data-structures, dfs-and-similar, graphs 19,644 4m 40s ✓
E Lunar New Year and Red Envelopes 2100 data-structures, dp 2,816 5m 6s ✓
F Lunar New Year and a Recursive Sequence 2400 math, matrices, number-theory 1,182 5m 1s
Practice › Codeforces Solutions › Codeforces Round 536 (Div. 2) ›

CF 1106E - Lunar New Year and Red Envelopes

We are given a timeline from 1 to n and a collection of intervals, each representing a “red envelope” that becomes usable only during a certain time window.
codeforces competitive-programming data-structures dp Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 536 (Div. 2) ›

CF 1106F - Lunar New Year and a Recursive Sequence

The sequence evolves by repeatedly combining the previous (k) terms using multiplicative weights. Each new term is formed by taking the last (k) values, raising them to fixed exponents (b1 dots bk), multiplying them together, and reducing modulo a large prime (p).
codeforces competitive-programming math matrices number-theory Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 536 (Div. 2) ›

CF 1106D - Lunar New Year and a Wander

We are given an undirected connected graph with $n$ nodes. Bob starts at node 1 and performs a walk along edges. Every time he enters a node that has never been seen before, he writes it down.
codeforces competitive-programming data-structures dfs-and-similar graphs greedy shortest-paths Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 536 (Div. 2) ›

CF 1106A - Lunar New Year and Cross Counting

We are given a square grid filled with two possible characters, X and .. The task is to scan every interior cell of this grid and decide whether it is the center of a “cross” pattern formed by diagonals.
codeforces competitive-programming implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 536 (Div. 2) ›

CF 1106C - Lunar New Year and Number Division

We are given an even-length list of positive integers, and we must partition these numbers into groups. Each group must contain at least two elements, and every number must belong to exactly one group.
codeforces competitive-programming greedy implementation math sortings Jun 12, 2026