Codeforces Round 973 (Div. 2)

Solutions for Codeforces Round 973 (Div. 2) (contest 2013). 2/6 problems verified against sample I/O. Difficulty range: 800-2700.

6 items

Codeforces Round 973 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2700 | Time: 16m

Problem	Name	Rating	Tags	Solve Time	Verified
A	Zhan's Blender	800	constructive-algorithms, math	1m 44s	✓
B	Battle for Survive	900	constructive-algorithms, greedy, math	3m 34s	✗
C	Password Cracking	1400	constructive-algorithms, interactive, strings	2m 13s	✗
D	Minimize the Difference	1900	binary-search, greedy	5m 14s	✗
E	Prefix GCD	2200	brute-force, dp, greedy	1m 39s	✗
F1	Game in Tree (Easy Version)	2700	binary-search, brute-force, data-structures	1m 36s	✓

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

CF 2013D - Minimize the Difference

We are given an array where each operation allows moving one unit from position i to position i+1. Repeating this many times means we can only push values to the right, never to the left, and never create or destroy total sum.

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

CF 2013E - Prefix GCD

We are given an array of positive integers and asked to reorder it to minimize the sum of the greatest common divisors of all its prefixes.

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

CF 2013B - Battle for Survive

We are given a set of fighters, each with a numerical rating. Battles are arranged sequentially until only one fighter remains. In each battle, one fighter is eliminated and their rating is subtracted from the winner's rating.

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

CF 2013C - Password Cracking

We are given a hidden binary string of length n. The only operation available is to ask whether some binary string t appears as a contiguous substring of the hidden string.

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

CF 2013F1 - Game in Tree (Easy Version)

We are given a tree. One player, Alice, always starts at vertex 1. The other player, Bob, starts at a vertex that lies on a fixed simple path between two vertices u and v.

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

CF 2013A - Zhan's Blender

Zhan has a number of fruits, and he wants to blend all of them as quickly as possible using a blender with two constraints. Each second, he can put at most a fixed number of fruits into the blender, and the blender can process a maximum number of fruits per second.