Codeforces Round 998 (Div. 3)

Solutions for Codeforces Round 998 (Div. 3) (contest 2060). 4/7 problems verified against sample I/O. Difficulty range: 800-2400.

7 items

Codeforces Round 998 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 4/7 | Rating range: 800-2400 | Time: 11m 10s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Fibonacciness	800	brute-force	1m 5s	✓
B	Farmer John's Card Game	1000	greedy, sortings	1m 21s	✓
C	Game of Mathletes	900	games, greedy, sortings	1m 18s	✓
D	Subtract Min Sort	1100	greedy	1m 48s	✗
E	Graph Composition	1500	dfs-and-similar, dsu, graphs	1m 14s	✓
F	Multiplicative Arrays	2200	combinatorics, dp, number-theory	2m 24s	✗
G	Bugged Sort	2400	dp, greedy, sortings	2m	✗

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

CF 2060G - Bugged Sort

The failure you show is not enough to diagnose the algorithm itself. Let's trace what happened: The input contains 5 test cases: The program produced only: instead of: This means the code successfully processed the first test case and then terminated before handling the…

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

CF 2060F - Multiplicative Arrays

We are asked to count arrays of integers where the product of all elements equals a specific target number. More concretely, for given integers $k$ and $n$, we need to determine, for every number $x$ from $1$ to $k$, how many arrays $a$ exist such that each element is between…

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

CF 2060E - Graph Composition

We are given two undirected graphs on the same set of vertices. One graph, call it the working graph, is the structure we are allowed to modify. The second graph is a fixed reference structure that we must eventually “match” in terms of connectivity.

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

CF 2060D - Subtract Min Sort

We are given an array of positive integers. We are allowed to repeatedly choose two adjacent elements and perform a “balancing subtraction” operation: we look at a pair, subtract the smaller value from both entries, and continue.

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

CF 2060B - Farmer John's Card Game

We are given several independent test cases. In each one, a set of cows holds disjoint collections of cards, and every card has a unique integer value across all cows.

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

CF 2060A - Fibonacciness

We are given four known values that represent an array of five integers with the middle element missing. The missing position is the third one, and we are free to choose any integer value for it, including negatives or zero.

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

CF 2060C - Game of Mathletes

We are given an array of integers written on a board. The game repeatedly removes two numbers per round, but the order matters: Alice removes one number first with the intent of making Bob fail to form a good pair later, while Bob responds by removing another number to try to…