Codeforces Beta Round 10

5 problems from Codeforces Beta Round 10 (contest 10), difficulty 900-2800. 4/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 10

Beta | 5 problems | 4/5 verified | Difficulty 900-2800 | 8m 3s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Power Consumption Calculation	900	implementation	8,343	1m 30s	✓
B	Cinema Cashier	1500	dp, implementation	2,052	1m 24s	✓
C	Digital Root	2000	number-theory	1,700	1m 41s	✓
D	LCIS	2800	dp	5,627	2m
E	Greedy Change	2600	constructive-algorithms	924	1m 28s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 10 ›

CF 10A - Power Consumption Calculation

Tom uses his laptop during several disjoint time intervals. While he is actively using it, the laptop stays in normal mode and consumes P1 watts per minute. When he stops interacting with the laptop, the machine does not immediately switch to lower-power states.

Practice › Codeforces Solutions › Codeforces Beta Round 10 ›

CF 10B - Cinema Cashier

The problem describes a cinema hall in Berland with K rows and K seats per row, where K is always odd. Customers come in groups of size M and request consecutive seats.

Practice › Codeforces Solutions › Codeforces Beta Round 10 ›

CF 10C - Digital Root

We are given an integer N. Consider all triples (A, B, C) where every value lies in the range [1, N].

Practice › Codeforces Solutions › Codeforces Beta Round 10 ›

CF 10D - LCIS

We are given two integer arrays. We need to build the longest sequence that satisfies two conditions at the same time.

Practice › Codeforces Solutions › Codeforces Beta Round 10 ›

CF 10E - Greedy Change

We are asked to investigate whether the greedy algorithm for making change can fail with a given set of coin denominations.