Codeforces Round 276 (Div. 1)

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

5 items

Codeforces Round 276 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1700-2600 | 11m 18s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Bits	1700	bitmasks, constructive-algorithms	13,377	1m 37s	✓
B	Maximum Value	2100	binary-search, math, sortings	7,731	1m 35s	✓
C	Strange Sorting	2600	implementation, math	629	2m 45s
D	Kindergarten	2400	data-structures, dp, greedy	3,038	2m 2s
E	Sign on Fence	2500	binary-search, constructive-algorithms, data-structures	3,029	3m 19s	✓

Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484E - Sign on Fence

We have a fence represented by an array of heights. A rectangular sign must be placed on top of some consecutive panels. The sign has a fixed width w, so it must cover exactly w consecutive fence panels.

Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484D - Kindergarten

We have a line of children, each with an integer charisma value. The goal is to partition the line into contiguous groups. For each group, its sociability is the difference between the largest and smallest charisma values in that group.

Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484C - Strange Sorting

Working

Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484A - Bits

We are asked to process several queries, each defined by a lower bound l and an upper bound r. For each query, we need to find the integer x within the interval [l, r] such that the number of set bits in its binary representation is as large as possible.

Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484B - Maximum Value

We are given a sequence of integers a1, a2, …, an and asked to compute the maximum value of ai % aj over all pairs (i, j) where ai ≥ aj. The input consists of the number of integers n and the sequence itself.