Codeforces Round 702 (Div. 3)

Solutions for Codeforces Round 702 (Div. 3) (contest 1490). 5/7 problems verified against sample I/O. Difficulty range: 800-1900.

7 items

Codeforces Round 702 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 5/7 | Rating range: 800-1900 | Time: 21m 17s

Problem Name Rating Tags Solve Time Verified
A Dense Array 800 greedy, math 1m 58s ✓
B Balanced Remainders 1000 brute-force, constructive-algorithms, math 5m 10s ✓
C Sum of Cubes 1100 binary-search, brute-force, math 2m 30s ✓
D Permutation Transformation 1200 dfs-and-similar, divide-and-conquer, implementation 2m 32s ✗
E Accidental Victory 1400 binary-search, data-structures, greedy 3m 17s ✗
F Equalize the Array 1500 binary-search, data-structures, greedy 3m 6s ✓
G Old Floppy Drive 1900 binary-search, data-structures, math 2m 44s ✓
Practice › Codeforces Solutions › Codeforces Round 702 (Div. 3) ›

Practice › Codeforces Solutions › Codeforces Round 702 (Div. 3) ›

CF 1490G - Old Floppy Drive

We have a circular array of integers, representing a disk in an old floppy drive. Each integer can be positive or negative.
codeforces competitive-programming binary-search data-structures math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 702 (Div. 3) ›

CF 1490F - Equalize the Array

We are given an array of integers and are allowed to delete elements. After deletions, the remaining elements must satisfy a strong regularity condition: there must exist a value $C$ such that every number that appears in the final array appears exactly $C$ times, or not at all.
codeforces competitive-programming binary-search data-structures greedy math sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 702 (Div. 3) ›

CF 1490E - Accidental Victory

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming binary-search data-structures greedy Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 702 (Div. 3) ›

CF 1490B - Balanced Remainders

We are given an array whose length is always divisible by three. For every number, only its remainder modulo 3 matters. A single move increases one array element by 1.
codeforces competitive-programming brute-force constructive-algorithms math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 702 (Div. 3) ›

CF 1490D - Permutation Transformation

We are given a permutation of length $n$, which is an array containing every integer from 1 to $n$ exactly once. The task is to view this permutation as a way to construct a binary tree: the root is the largest element, the elements to the left of it form the left subtree…
codeforces competitive-programming dfs-and-similar divide-and-conquer implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 702 (Div. 3) ›

CF 1490A - Dense Array

We are given several small arrays of positive integers. For each array, we are allowed to insert new numbers anywhere, including between existing elements.
codeforces competitive-programming greedy math Jun 10, 2026