Codeforces Round 278 (Div. 2)

Solutions for Codeforces Round 278 (Div. 2) (contest 488). 0/2 problems verified against sample I/O. Difficulty range: 1100-1900.

2 items

Codeforces Round 278 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 1100-1900 | Time: 21m 45s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Giga Tower	1100	brute-force	10m 47s	✗
B	Candy Boxes	1900	brute-force, constructive-algorithms, math	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.