Codeforces Round 164 (Div. 2)

5 problems from Codeforces Round 164 (Div. 2) (contest 268), difficulty 800-2300. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 164 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 800-2300 | 9m 9s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Games	800	brute-force	104,168	1m 34s	✓
B	Buttons	1000	implementation, math	35,776	1m 34s	✓
C	Beautiful Sets of Points	1500	constructive-algorithms, implementation	14,637	1m 58s
D	Wall Bars	2300	dp	576	1m 23s
E	Playlist	2100	math, probabilities, sortings	1,137	2m 40s	✓

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

CF 268A - Games

We are given the uniform colors of all teams in a football championship. Each team has a home color and an away color. Every ordered pair of distinct teams plays exactly one match, with one team acting as the host and the other as the guest.

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

CF 268C - Beautiful Sets of Points

We are given all lattice points inside a rectangle, meaning every point $(x,y)$ with integer coordinates such that $0 le x le n$, $0 le y le m$, and $(0,0)$ is excluded.

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

CF 268E - Playlist

Each song has two attributes. Its length is l, and independently Manao likes it with probability p. When a song is played for the first time, one of two things happens. If he likes it, the song is added to a collection of remembered songs.

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

CF 268D - Wall Bars

The problem asks us to count how many ways we can place horizontal bars on a vertical pole of height n, such that a child starting on the ground can climb to the top section of the pole, moving only along bars in the same direction and not exceeding a vertical distance of h…

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

CF 268B - Buttons

There is a hidden order of n buttons. A button only stays pressed if it is the next correct button in that order. If at any point we press a wrong button, every previously pressed button pops back out and we must start building the sequence again from the beginning.