Codeforces Beta Round 76 (Div. 1 Only)

5 problems from Codeforces Beta Round 76 (Div. 1 Only) (contest 93), difficulty 1700-2600. 3/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 76 (Div. 1 Only)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1700-2600 | 10m 8s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Frames	1700	implementation	2,071	1m 51s	✓
B	End of Exams	1900	greedy	988	1m 43s
C	Azembler	2500	brute-force, implementation	450	2m 1s	✓
D	Flags	2500	dp, math, matrices	444	3m 28s
E	Lostborn	2600	dp, math, number-theory	540	1m 5s	✓

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

CF 93A - Frames

The folders are displayed in a grid with exactly m columns per row. Folder 1 is in the top-left corner, folder 2 is next to it, and so on. After every m folders we move to the next row. A rectangular frame selection toggles every folder inside the rectangle.

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

CF 93B - End of Exams

We are asked to distribute milk from a set of bottles into cups such that each bottle contributes to at most two cups, and all cups end up with the same total volume. Specifically, we have n bottles, each containing w units of milk, and m friends who each receive one cup.

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

CF 93C - Azembler

We start with one register, eax, containing some unknown value x. Every other register contains 0. The goal is to produce n x in any register using the minimum possible number of lea instructions. The instruction set is surprisingly limited, but also surprisingly powerful.

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

CF 93D - Flags

We need to count stripe sequences built from four colors: black, red, white, and yellow. A sequence is valid if it satisfies several local restrictions. Equal adjacent colors are forbidden. White cannot touch yellow. Red cannot touch black.

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

CF 93E - Lostborn

We are asked to calculate how many numbers from 1 to n are not divisible by any number in a given set of integers, called hit indicators. Each indicator is guaranteed to be coprime with the others, and there are k of them, each at most 1000.