Codeforces Round 962 (Div. 3)

Solutions for Codeforces Round 962 (Div. 3) (contest 1996). 6/7 problems verified against sample I/O. Difficulty range: 800-2200.

7 items

Codeforces Round 962 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 6/7 | Rating range: 800-2200 | Time: 18m 25s

Problem Name Rating Tags Solve Time Verified
A Legs 800 binary-search, math, ternary-search 2m 12s ✓
B Scale 800 greedy, implementation 2m 31s ✓
C Sort 1200 dp, greedy, sortings 2m 35s ✓
D Fun 1500 binary-search, brute-force, combinatorics 2m 17s ✓
E Decode 1600 combinatorics, data-structures, implementation 2m 12s ✗
F Bomb 1900 binary-search, greedy, math 2m 49s ✓
G Penacony 2200 brute-force, data-structures, graphs 3m 49s ✓
Practice › Codeforces Solutions › Codeforces Round 962 (Div. 3) ›

CF 1996G - Penacony

The problem describes a circular town with n houses connected by roads that form a single cycle. Each house i connects to i+1, and the last house n connects back to house 1. Among these residents, there are m friendships, each linking two distinct houses.
codeforces competitive-programming brute-force data-structures graphs greedy hashing Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 962 (Div. 3) ›

CF 1996F - Bomb

We are asked to maximize a score over a series of operations on two arrays. Each array has length $n$. Array $a$ represents the current “value” of each element, and array $b$ represents how much that element decays after it is used.
codeforces competitive-programming binary-search greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 962 (Div. 3) ›

CF 1996E - Decode

We are given a binary string, and we look at every possible contiguous segment of it. Each segment itself contains many subsegments, and we are interested only in those subsegments whose number of zeros equals the number of ones.
codeforces competitive-programming combinatorics data-structures implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 962 (Div. 3) ›

CF 1996D - Fun

We need to count ordered triples of positive integers $(a,b,c)$ that satisfy two independent restrictions. The first restriction limits the pairwise products: $$ab + ac + bc le n$$ The second restriction limits the sum: $$a + b + c le x$$ The word "ordered" matters.
codeforces competitive-programming binary-search brute-force combinatorics math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 962 (Div. 3) ›

CF 1996C - Sort

We are given two strings, a and b, of equal length n. For each query, defined by a range [l, r], we are allowed to modify individual characters of a within that range. The goal is to transform the substring a[l..
codeforces competitive-programming dp greedy sortings strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 962 (Div. 3) ›

CF 1996B - Scale

We are given a square grid of size $n times n$ where each cell contains either a zero or a one. The task is to reduce this grid by a factor $k$, which is guaranteed to divide $n$ evenly.
codeforces competitive-programming greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 962 (Div. 3) ›

CF 1996A - Legs

The farm has only chickens and cows, and Farmer John counts a total of n legs. Chickens contribute 2 legs each and cows contribute 4 legs each. The question asks for the smallest possible number of animals consistent with the total leg count.
codeforces competitive-programming binary-search math ternary-search Jun 8, 2026