Codeforces Beta Round 64

Solutions for Codeforces Beta Round 64 (contest 70). 4/5 problems verified against sample I/O. Difficulty range: 1300-2700.

5 items

Codeforces Beta Round 64

Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1300-2700 | Time: 11m 7s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cookies	1300	math	1m 46s	✓
B	Text Messaging	1600	expression-parsing, greedy, strings	1m 39s	✓
C	Lucky Tickets	2200	binary-search, data-structures, sortings	2m 11s	✓
D	Professor's task	2700	data-structures, geometry	2m 2s	✓
E	Information Reform	2700	dp, implementation, trees	3m 29s	✗

Practice › Codeforces Solutions › Codeforces Beta Round 64 ›

CF 70A - Cookies

We have a square box of size 2^n × 2^n. Inside this box, we repeatedly place special triangular cookies. A cookie of size k occupies the upper triangular part of a k × k square, including the main diagonal.

Practice › Codeforces Solutions › Codeforces Beta Round 64 ›

CF 70B - Text Messaging

We are given the maximum length of a single SMS message and one complete text consisting of sentences separated by spaces. A sentence always ends with one of ., ?, or !. Words contain only letters.

Practice › Codeforces Solutions › Codeforces Beta Round 64 ›

CF 70C - Lucky Tickets

Each ticket is described by two positive integers. The first is the series number a, the second is the ticket number inside that series b.

Practice › Codeforces Solutions › Codeforces Beta Round 64 ›

CF 70D - Professor's task

We are asked to maintain a set of points on a plane and support two operations: adding a point, and checking if a point lies inside the convex hull of the current set. The convex hull is the minimal convex polygon enclosing all points.

Practice › Codeforces Solutions › Codeforces Beta Round 64 ›

CF 70E - Information Reform

We are given a country with cities connected by roads such that the road network forms a tree: there is exactly one simple path between any two cities. Each road has equal length in terms of counting the number of edges.