Codeforces Round 169 (Div. 2)

Solutions for Codeforces Round 169 (Div. 2) (contest 276). 2/3 problems verified against sample I/O. Difficulty range: 900-1700.

3 items

Codeforces Round 169 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 900-1700 | Time: 4m 36s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Lunch Rush	900	implementation	1m 30s	✗
C	Little Girl and Maximum Sum	1500	data-structures, greedy, implementation	1m 42s	✓
D	Little Girl and Maximum XOR	1700	bitmasks, dp, greedy	1m 24s	✓

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

CF 276A - Lunch Rush

The problem describes a lunch scenario where three Rabbits have a fixed break of k time units and a list of n restaurants. Each restaurant is defined by two numbers: the joy fᵢ the Rabbits gain if they finish on time, and the time tᵢ it takes to eat there.

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

CF 276C - Little Girl and Maximum Sum

We are given an array and several range queries. Each query asks for the sum of all elements between two indices.

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

CF 276D - Little Girl and Maximum XOR

We are given two integers, l and r. We may choose any two numbers a and b such that both lie inside the interval [l, r] and a ≤ b. Among all such pairs, we must compute the maximum possible value of a XOR b. The XOR operation compares bits position by position.