Codeforces Round 491 (Div. 2)

4 problems from Codeforces Round 491 (Div. 2) (contest 991), difficulty 1000-2700. 4/4 solutions verified against sample I/O.

4 items

Codeforces Round 491 (Div. 2)

Div. 2 | 4 problems | 4/4 verified | Difficulty 1000-2700 | 5m 27s

#	Problem	Rating	Tags	Accepted	Time	✓
A	If at first you don't succeed...	1000	implementation	11,232	1m 14s	✓
C	Candies	1500	binary-search, implementation	11,509	1m 9s	✓
D	Bishwock	1500	dp, greedy	7,736	1m 33s	✓
F	Concise and clear	2700	brute-force, greedy, implementation	340	1m 31s	✓

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

CF 991D - Bishwock

We are given a board with two rows and $n$ columns, so each cell is either empty or blocked. A blocked cell cannot be used. Our task is to place as many fixed L-shaped pieces as possible on the board, where each piece occupies exactly three cells in one of four orientations.

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

CF 991F - Concise and clear

We are given a single integer $n$ up to $10^{10}$. The task is not to compute anything from it, but to rewrite it as a mathematical expression using only digits, plus, multiplication, and exponentiation.

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

CF 991A - If at first you don't succeed...

We are given summary statistics about how students in a group behaved after an exam. Every student belongs to exactly one of four categories: they either visited only BugDonalds, only BeaverKing, both restaurants, or stayed at home because they failed the exam.

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

CF 991C - Candies

We are given an initial pile of candies and a fixed daily rule that transforms this pile over time. Each morning Vasya chooses a constant number k.