Codeforces Round 278 (Div. 2)

2 problems from Codeforces Round 278 (Div. 2) (contest 488), difficulty 1100-1900. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 278 (Div. 2)

Div. 2 | 2 problems | 0/2 verified | Difficulty 1100-1900 | 21m 45s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Giga Tower	1100	brute-force	14,943	10m 47s
B	Candy Boxes	1900	brute-force, constructive-algorithms, math	2,263	10m 58s

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

CF 488A - Giga Tower

We are standing at an integer floor number in a very large tower that extends far below zero and far above zero. From our current floor $a$, we are only allowed to move upward, meaning we repeatedly add positive integers.

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

CF 488B - Candy Boxes

The task is to reconstruct a set of four integers representing candy counts in boxes such that three properties are equal: the arithmetic mean, the median, and the range. We are given some subset of these four numbers (0 to 4) in arbitrary order.