Codeforces Beta Round 80 (Div. 1 Only)

5 problems from Codeforces Beta Round 80 (Div. 1 Only) (contest 103), difficulty 1100-2900. 3/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 80 (Div. 1 Only)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1100-2900 | 10m 20s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Testing Pants for Sadness	1100	greedy, implementation, math	6,572	1m 39s	✓
B	Cthulhu	1500	dfs-and-similar, dsu, graphs	10,648	1m 43s	✓
C	Russian Roulette	1900	constructive-algorithms, greedy	1,049	2m	✓
D	Time to Raid Cowavans	2100	brute-force, data-structures, sortings	2,526	1m 48s
E	Buying Sets	2900	flows, graph-matchings	1,067	3m 10s

Practice › Codeforces Solutions › Codeforces Beta Round 80 (Div. 1 Only) ›

CF 103A - Testing Pants for Sadness

The test contains several questions that must be answered in order. Each question has multiple answer choices, and exactly one of them is correct. Vaganych does not know any correct answers in advance, but after making a mistake he remembers which options were wrong.

Practice › Codeforces Solutions › Codeforces Beta Round 80 (Div. 1 Only) ›

CF 103B - Cthulhu

We are given an undirected graph and need to decide whether it matches a very specific structure. The graph should contain exactly one simple cycle, and every other vertex must belong to a tree attached to some vertex on that cycle.

Practice › Codeforces Solutions › Codeforces Beta Round 80 (Div. 1 Only) ›

CF 103C - Russian Roulette

The cylinder has n slots arranged in a circle, and exactly k of them contain bullets. Before the game starts, the cylinder is rotated uniformly at random, so every cyclic shift is equally likely. After the rotation, Sasha shoots first.

Practice › Codeforces Solutions › Codeforces Beta Round 80 (Div. 1 Only) ›

CF 103D - Time to Raid Cowavans

We have an array of cow weights. For every query (a, b), we repeatedly take positions a, a + b, a + 2b, ... until the index exceeds n, and we must output the sum of all visited values.

Practice › Codeforces Solutions › Codeforces Beta Round 80 (Div. 1 Only) ›

CF 103E - Buying Sets

We are given several sets of integers, each with an associated cost. We may choose any collection of these sets, including the empty collection. Let the number of chosen sets be $k$, and let the union of all chosen sets contain $u$ distinct integers.