Codeforces Round 147 (Div. 2)

Solutions for Codeforces Round 147 (Div. 2) (contest 237). 3/3 problems verified against sample I/O. Difficulty range: 1000-2000.

4 items

Codeforces Round 147 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 1000-2000 | Time: 9m 35s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Free Cash	1000	implementation	3m 17s	✓
C	Primes on Interval	1600	binary-search, number-theory, two-pointers	4m 4s	✓
D	T-decomposition	2000	dfs-and-similar, graphs, greedy	2m 14s	✓

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

CF 237A - Free Cash

We are given the arrival times of customers visiting a cafe during one day. Every customer is served in less than one minute, so the only time a queue can appear is when several customers arrive at exactly the same minute.

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

CF 237B - Young Table

The shape of the table is fixed. Row lengths are non-increasing, so every row is no longer than the row above it. The cells contain all integers from 1 to s exactly once, where s is the total number of cells. We may swap the contents of any two cells.

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

CF 237C - Primes on Interval

We are looking at every contiguous segment inside the interval $[a, b]$. For a chosen length $l$, every segment of exactly $l$ consecutive integers must contain at least $k$ prime numbers. The task is to find the smallest such $l$. If no segment length works, we print $-1$.

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

CF 237D - T-decomposition

We are given a tree $s$ with $n$ vertices. We must construct another tree $t$, whose nodes are subsets of vertices of $s$. Each subset is usually called a bag. The decomposition must satisfy three conditions. First, every original vertex must appear in at least one bag.