Codeforces Round 106 (Div. 2)

5 problems from Codeforces Round 106 (Div. 2) (contest 149), difficulty 900-2300. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 106 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 900-2300 | 8m 2s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Business trip	900	greedy, implementation, sortings	45,971	1m 33s	✓
B	Martian Clock	1600	implementation	2,390	1m 25s	✓
C	Division into Teams	1500	greedy, math, sortings	5,733	1m 40s
D	Coloring Brackets	1900	dp	4,608	2m 8s	✓
E	Martian Strings	2300	string-suffix-structures, strings	2,515	1m 16s	✓

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

CF 149A - Business trip

Petya can decide in which months he waters the flower. Each month contributes a fixed amount of growth, and skipping a month contributes nothing. The goal is to reach at least k centimeters of total growth while using as few months as possible.

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

CF 149B - Martian Clock

We are given a string representing a Martian time in the format "a:b", where a is the hour component and b is the minute component. Unlike Earth time in base 10, these strings could represent numbers in any numeral system with a base greater than 1.

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

CF 149C - Division into Teams

We have a group of boys, each with a skill level in football. The task is to split them into two teams such that the teams are nearly equal in size and the total skill levels of the teams are roughly balanced.

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

CF 149D - Coloring Brackets

We are given a valid parenthesis sequence. Every opening bracket has a unique matching closing bracket, and the pairs are properly nested. We want to assign colors to brackets under two rules.

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

CF 149E - Martian Strings

The problem describes a Martian with a row of eyes, each covered by a patch marked with an uppercase letter. The string of letters visible when all eyes are opened represents a sequence s of length n.