Codeforces Round 673 (Div. 1)

Solutions for Codeforces Round 673 (Div. 1) (contest 1416). 1/6 problems verified against sample I/O. Difficulty range: 1500-3300.

6 items

Codeforces Round 673 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 1/6 | Rating range: 1500-3300 | Time: 17m 59s

Problem Name Rating Tags Solve Time Verified
A k-Amazing Numbers 1500 binary-search, data-structures, implementation 2m 28s ✓
B Make Them Equal 2000 constructive-algorithms, greedy, math 1m 58s ✗
C XOR Inverse 2000 bitmasks, data-structures, divide-and-conquer 1m 48s ✗
D Graph and Queries 2600 data-structures, dsu, graphs 7m 45s ✗
E Split 3200 binary-search, data-structures, dp 1m 43s ✗
F Showing Off 3300 flows, graph-matchings, greedy 2m 17s ✗
Practice › Codeforces Solutions › Codeforces Round 673 (Div. 1) ›

CF 1416D - Graph and Queries

We are dealing with a dynamic connectivity problem on an undirected graph with n vertices and m edges. Each vertex initially holds a distinct integer between 1 and n.
codeforces competitive-programming data-structures dsu graphs implementation trees Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 673 (Div. 1) ›

CF 1416F - Showing Off

Think of each cell as a vertex of a directed graph. Every vertex chooses exactly one adjacent vertex as its outgoing edge. A graph where every vertex has outdegree exactly one is a functional graph.
codeforces competitive-programming flows graph-matchings greedy implementation Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 673 (Div. 1) ›

CF 1416E - Split

We are given an array of positive integers, and for each element in the array we are allowed to split it into two positive integers whose sum equals the original number. After splitting all elements, we construct a new array by placing these pairs consecutively.
codeforces competitive-programming binary-search data-structures dp greedy Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 673 (Div. 1) ›

CF 1416A - k-Amazing Numbers

We are given an array whose values are between 1 and n. For every length k, we look at all subarrays of length k. A value x is considered valid if every such subarray contains at least one occurrence of x. Among all valid values, we must output the smallest one.
codeforces competitive-programming binary-search data-structures implementation two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 673 (Div. 1) ›

CF 1416B - Make Them Equal

We are given an array of positive integers and allowed to redistribute values between pairs of elements using a linear operation that depends on the index of the first element.
codeforces competitive-programming constructive-algorithms greedy math Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 673 (Div. 1) ›

CF 1416C - XOR Inverse

We are given an array of non-negative integers, and we need to pick a number $x$ so that when we XOR every element in the array with $x$, the resulting array has as few inversions as possible.
codeforces competitive-programming bitmasks data-structures divide-and-conquer dp greedy math sortings strings trees Jun 11, 2026