Codeforces Round 251 (Div. 2)

5 problems from Codeforces Round 251 (Div. 2) (contest 439), difficulty 900-2100. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 251 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 900-2100 | 5m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Devu, the Singer and Churu, the Joker	900	greedy, implementation	26,621	1m 12s	✓
B	Devu, the Dumb Guy	1200	implementation, sortings	15,017	1m 23s	✓
C	Devu and Partitioning of the Array	1700	brute-force, constructive-algorithms, implementation	4,170	1m 3s	✓
D	Devu and his Brother	1700	binary-search, sortings, ternary-search	6,846	57s	✓
E	Devu and Birthday Celebration	2100	combinatorics, dp, math	1,838	1m 12s	✓

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

CF 439B - Devu, the Dumb Guy

We are asked to teach Devu a set of subjects, each consisting of a certain number of chapters. Devu starts with a fixed amount of time required per chapter, and after completing each subject, the time per chapter decreases by exactly one hour for the next subject, down to a…

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

CF 439C - Devu and Partitioning of the Array

We are given an array of distinct integers, and we need to split it into exactly k non-empty groups. Among these groups, exactly p must have an even sum, and the remaining k - p must have an odd sum.

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

CF 439E - Devu and Birthday Celebration

We are distributing a total of n identical sweets into f distinct friends, with the rule that every friend must receive at least one sweet. So the outcome of a distribution can be viewed as an ordered array a1, a2, ..., af of positive integers whose sum is n.

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

CF 439A - Devu, the Singer and Churu, the Joker

The problem asks us to schedule an event where Devu, a singer, performs n songs of varying lengths, and Churu, a comedian, tells jokes of fixed 5-minute duration.

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

CF 439D - Devu and his Brother

We are given two integer arrays, one belonging to Devu and the other to his brother. We are allowed to repeatedly increase or decrease any single element of either array by 1 in one operation.