Manthan, Codefest 18 (rated, Div. 1 + Div. 2)

6 problems from Manthan, Codefest 18 (rated, Div. 1 + Div. 2) (contest 1037), difficulty 1300-3200. 3/6 solutions verified against sample I/O.

6 items

Manthan, Codefest 18 (rated, Div. 1 + Div. 2)

Div. 1+2 | 6 problems | 3/6 verified | Difficulty 1300-3200 | 38m 34s

# Problem Rating Tags Accepted Time ✓
A Packets 1300 constructive-algorithms, greedy, math 11,828 10m 19s
B Reach Median 1300 greedy 10,877 3m 15s ✓
C Equalize 1300 dp, greedy, strings 20,111 9m 29s ✓
D Valid BFS? 1700 dfs-and-similar, graphs, shortest-paths 19,089 4m 53s
G A Game on Strings 3200 games 373 5m 37s ✓
H Security 3200 data-structures, string-suffix-structures 1,209 5m 1s
Practice › Codeforces Solutions › Manthan, Codefest 18 (rated, Div. 1 + Div. 2) ›

CF 1037G - A Game on Strings

We are given a base string and then asked to answer many independent games played on substrings of it. Each game starts from a chosen segment of the string, and two players alternate turns.
codeforces competitive-programming games Jun 16, 2026
Practice › Codeforces Solutions › Manthan, Codefest 18 (rated, Div. 1 + Div. 2) ›

CF 1037H - Security

We are given a fixed base string s. Each query selects a contiguous segment s[l..r] and a comparison string x. From that segment, we consider every distinct substring, meaning every string formed by choosing a start i and end j with l ≤ i ≤ j ≤ r.
codeforces competitive-programming data-structures string-suffix-structures Jun 16, 2026
Practice › Codeforces Solutions › Manthan, Codefest 18 (rated, Div. 1 + Div. 2) ›

CF 1037A - Packets

Codeforces 1037A: Packets
codeforces competitive-programming constructive-algorithms greedy math Jun 16, 2026
Practice › Codeforces Solutions › Manthan, Codefest 18 (rated, Div. 1 + Div. 2) ›

CF 1037C - Equalize

We are given two binary strings of equal length. Think of them as two rows of switches, where each position is either on or off.
codeforces competitive-programming dp greedy strings Jun 16, 2026
Practice › Codeforces Solutions › Manthan, Codefest 18 (rated, Div. 1 + Div. 2) ›

CF 1037D - Valid BFS?

We are given a tree with vertices labeled from 1 to n, and a proposed ordering of all vertices. The task is to decide whether this ordering could arise from running a breadth-first search starting at vertex 1, under some valid choice of adjacency ordering.
codeforces competitive-programming dfs-and-similar graphs shortest-paths trees Jun 16, 2026
Practice › Codeforces Solutions › Manthan, Codefest 18 (rated, Div. 1 + Div. 2) ›

CF 1037B - Reach Median

We are given a list of integers and a target value s. The goal is not to make all elements equal to s, but only to ensure that after we sort the array, the middle element becomes exactly s. Since the length is odd, there is a single well-defined median position.
codeforces competitive-programming greedy Jun 16, 2026