Codeforces Round 133 (Div. 2)

Solutions for Codeforces Round 133 (Div. 2) (contest 216). 3/5 problems verified against sample I/O. Difficulty range: 1200-2000.

5 items

Codeforces Round 133 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1200-2000 | Time: 7m 31s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Tiling with Hexagons	1200	implementation, math	56s	✓
B	Forming Teams	1700	dfs-and-similar, implementation	1m 27s	✓
C	Hiring Staff	1800	greedy	2m 5s	✗
D	Spider's Web	1700	binary-search, sortings, two-pointers	1m 26s	✗
E	Martian Luck	2000	math, number-theory	1m 37s	✓

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

CF 216A - Tiling with Hexagons

The floor is made from unit hexagonal tiles, and the whole hall itself forms a larger hexagon. The six sides of the hall contain a, b, c, a, b, c tiles respectively as we walk around the boundary.

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

CF 216B - Forming Teams

We can model the students as an undirected graph. Each student is a vertex, and every pair of enemies creates an edge. We want to split the remaining students into two teams of equal size such that no edge stays inside one team.

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

CF 216C - Hiring Staff

Each employee follows a rigid repeating schedule. Once hired on day x, the employee works for n consecutive days, then rests for m consecutive days, then repeats forever. So the cycle length is n + m, and inside each cycle the employee is active for the first n days.

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

CF 216D - Spider's Web

Paw the Spider's web consists of n main threads radiating from the center, dividing the plane into n equal sectors. Each sector may have bridges connecting its bounding main threads. Every bridge has attachment points at the same distance from the center.

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

CF 216E - Martian Luck

We are given a sequence of digits written in base k. Every digit is between 0 and k - 1, and one special digit b is called lucky. For every substring of the digit sequence, we interpret that substring as a base-k number, allowing leading zeroes.