Codeforces Round 148 (Div. 1)

Solutions for Codeforces Round 148 (Div. 1) (contest 238). 4/5 problems verified against sample I/O. Difficulty range: 1300-2900.

5 items

Codeforces Round 148 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1300-2900 | Time: 16m 8s

Problem Name Rating Tags Solve Time Verified
A Not Wool Sequences 1300 constructive-algorithms, math 5m 18s ✓
B Boring Partition 1800 constructive-algorithms 3m 56s ✓
C World Eater Brothers 2100 dfs-and-similar, dp, greedy 2m 5s ✓
D Tape Programming 2900 data-structures, implementation 1m 30s ✓
E Meeting Her 2600 dp, graphs, shortest-paths 3m 19s ✗
Practice › Codeforces Solutions › Codeforces Round 148 (Div. 1) ›

CF 238A - Not Wool Sequences

We work with arrays of length n, where every element is an integer from 0 to 2^m - 1. A sequence is called "wool" if there exists some contiguous subarray whose xor is 0. We are asked to count how many sequences are not wool, meaning every contiguous subarray has non-zero xor.
codeforces competitive-programming constructive-algorithms math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 148 (Div. 1) ›

CF 238B - Boring Partition

We are given an array of integers and a value h. Every pair of elements contributes a value depending on whether the two elements are placed into the same group or different groups.
codeforces competitive-programming constructive-algorithms May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 148 (Div. 1) ›

CF 238C - World Eater Brothers

We are given a world of n countries connected by n-1 directed roads. Ignoring the direction of these roads, the countries form a tree. Each brother wants to establish rule in some country and can control every country reachable via directed roads.
codeforces competitive-programming dfs-and-similar dp greedy trees May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 148 (Div. 1) ›

CF 238D - Tape Programming

We are given a sequence of characters consisting of digits 0-9 and the symbols < and . This sequence is interpreted as a simple tape program. The interpreter has two pointers: the current character pointer (CP) and the direction pointer (DP).
codeforces competitive-programming data-structures implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 148 (Div. 1) ›

CF 238E - Meeting Her

We are given a directed graph representing a city with junctions and streets. Urpal starts at junction a and wants to reach junction b using buses.
codeforces competitive-programming dp graphs shortest-paths May 29, 2026