Codeforces Round 762 (Div. 3)

Solutions for Codeforces Round 762 (Div. 3) (contest 1619). 2/8 problems verified against sample I/O. Difficulty range: 800-2400.

8 items

Codeforces Round 762 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 2/8 | Rating range: 800-2400 | Time: 18m 5s

Problem Name Rating Tags Solve Time Verified
A Square String? 800 implementation, strings 1m 39s ✗
B Squares and Cubes 800 implementation, math 6m 34s ✗
C Wrong Addition 1200 implementation 57s ✓
D New Year's Problem 1800 binary-search, greedy, sortings 1m 36s ✗
E MEX and Increments 1700 constructive-algorithms, data-structures, dp 1m 28s ✗
F Let's Play the Hat? 2000 brute-force, constructive-algorithms, greedy 1m 28s ✗
G Unusual Minesweeper 2000 binary-search, dfs-and-similar, dsu 3m 19s ✗
H Permutation and Queries 2400 brute-force, data-structures, divide-and-conquer 1m 4s ✓
Practice › Codeforces Solutions › Codeforces Round 762 (Div. 3) ›

CF 1619B - Squares and Cubes

Now we can clearly separate the real issue from all the noise in earlier attempts. Your “solution” is not consistently failing on a single algorithmic idea.
codeforces competitive-programming implementation math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 762 (Div. 3) ›

CF 1619G - Unusual Minesweeper

Each test case gives a set of mines placed on a 2D grid. Every mine has a position and a “natural lifetime”, meaning it will explode automatically after a given number of seconds if nothing triggers it earlier. The key twist is that explosions propagate.
codeforces competitive-programming binary-search dfs-and-similar dsu greedy sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 762 (Div. 3) ›

CF 1619H - Permutation and Queries

We are given a permutation of integers from 1 to $n$. Conceptually, this is an array of length $n$ in which every integer from 1 to $n$ appears exactly once, so every index maps to a unique value. On top of this array, we have two types of queries.
codeforces competitive-programming brute-force data-structures divide-and-conquer two-pointers Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 762 (Div. 3) ›

CF 1619F - Let's Play the Hat?

We are asked to organize a fair schedule for a multi-table game. There are $n$ players, $m$ tables, and $k$ rounds. Each round, every table must host either $lfloor n/m rfloor$ or $lceil n/m rceil$ players.
codeforces competitive-programming brute-force constructive-algorithms greedy math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 762 (Div. 3) ›

CF 1619E - MEX and Increments

We are given an array of non-negative integers and we can increment any element by 1 any number of times. The task is to determine for each integer from 0 up to the array length whether it is possible to transform the array so that its MEX (minimum excluded value) equals that…
codeforces competitive-programming constructive-algorithms data-structures dp greedy implementation math sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 762 (Div. 3) ›

CF 1619D - New Year's Problem

We are given several independent scenarios. In each scenario, Vlad has a fixed number of friends and a fixed number of shops. Each shop offers a value for every friend, representing how much joy that friend would get if their gift is bought there.
codeforces competitive-programming binary-search greedy sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 762 (Div. 3) ›

CF 1619A - Square String?

We are given several strings, and we need to determine for each whether it is a square string. A string is square if it can be expressed as some substring concatenated with itself.
codeforces competitive-programming implementation strings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 762 (Div. 3) ›

CF 1619C - Wrong Addition

The problem gives us two integers, a and s, and asks us to find a number b such that if we "add" a and b in Tanya's unusual way, we obtain s.
codeforces competitive-programming implementation Jun 10, 2026