Codeforces Round 1070 (Div. 2)

6 problems from Codeforces Round 1070 (Div. 2) (contest 2176), difficulty 800-2400. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 1070 (Div. 2)

Div. 2 | 6 problems | 2/6 verified | Difficulty 800-2400 | 14m 36s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Operations with Inversions	800	greedy, implementation, math	29,048	1m 47s
B	Optimal Shifts	1000	bitmasks, greedy, strings	22,889	5m 53s
C	Odd Process	1300	greedy, sortings	15,705	1m 51s
D	Fibonacci Paths	1800	data-structures, dp, graphs	5,757	1m 19s	✓
E	Remove at the lowest cost	2400	data-structures, dfs-and-similar, dp	1,276	2m 15s
F	Omega Numbers	2400	bitmasks, combinatorics, dp	1,487	1m 31s	✓

Practice › Codeforces Solutions › Codeforces Round 1070 (Div. 2) ›

CF 2176B - Optimal Shifts

We are given a binary string consisting of 0s and 1s, with at least one 1. The goal is to transform this string into a string of all 1s. To achieve this, we can repeatedly choose a shift d and perform a cyclic right shift of the string by d.

Practice › Codeforces Solutions › Codeforces Round 1070 (Div. 2) ›

CF 2176F - Omega Numbers

We are given several arrays, and for each array we need to evaluate a sum over all unordered pairs of indices. For each pair of values $ai, aj$, we look at the number of distinct prime factors in their product and then raise that count to a fixed power $k$.

Practice › Codeforces Solutions › Codeforces Round 1070 (Div. 2) ›

CF 2176E - Remove at the lowest cost

We are given an array of n elements. Each element has a value ai and a removal cost ci. The goal is to remove all elements except one, using a series of adjacent removals, paying the minimum total cost.

Practice › Codeforces Solutions › Codeforces Round 1070 (Div. 2) ›

CF 2176D - Fibonacci Paths

We are given a directed graph with $n$ vertices, each labeled with a positive integer $av$, and $m$ edges. Our goal is to count all simple paths that include at least two vertices, where the sequence of numbers along the path forms a generalized Fibonacci sequence.

Practice › Codeforces Solutions › Codeforces Round 1070 (Div. 2) ›

CF 2176C - Odd Process

We are given a multiset of coin values and asked to simulate a process that depends not only on which coins we pick, but also on the parity of the running sum inside a temporary bag.

Practice › Codeforces Solutions › Codeforces Round 1070 (Div. 2) ›

CF 2176A - Operations with Inversions

We are given an array of numbers, and we are allowed to repeatedly remove elements under a very specific condition. Each move chooses two indices $i < j$ such that the value at $i$ is strictly larger than the value at $j$, and then deletes the element at position $j$.