Codeforces Round 738 (Div. 2)

4 problems from Codeforces Round 738 (Div. 2) (contest 1559), difficulty 900-2500. 2/4 solutions verified against sample I/O.

4 items

Codeforces Round 738 (Div. 2)

Div. 2 | 4 problems | 2/4 verified | Difficulty 900-2500 | 10m 41s

# Problem Rating Tags Accepted Time ✓
A Mocha and Math 900 bitmasks, constructive-algorithms, math 45,555 1m 20s ✓
B Mocha and Red and Blue 900 dp, greedy 24,129 5m 16s
C Mocha and Hiking 1200 constructive-algorithms, graphs 22,792 2m 31s
D2 Mocha and Diana (Hard Version) 2500 brute-force, constructive-algorithms, dfs-and-similar 3,064 1m 34s ✓
Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559B - Mocha and Red and Blue

We are given a line of positions, each position holding a tile that must end up colored either red or blue. Some tiles are already fixed, while others are blank and can be assigned either color.
codeforces competitive-programming dp greedy Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559C - Mocha and Hiking

Codeforces 1559C: Mocha and Hiking
codeforces competitive-programming constructive-algorithms graphs Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559D2 - Mocha and Diana (Hard Version)

We are given two different forests built on the same set of vertices from 1 to n. Each forest is already acyclic, but they may have multiple connected components.
codeforces competitive-programming brute-force constructive-algorithms dfs-and-similar dsu graphs greedy trees two-pointers Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 738 (Div. 2) ›

CF 1559A - Mocha and Math

We are given an array of integers and allowed to perform a repeated operation: choose any contiguous subarray and replace each element in it with the bitwise AND of itself and its symmetric counterpart relative to the interval.
codeforces competitive-programming bitmasks constructive-algorithms math Jun 10, 2026