Codeforces Round 147 (Div. 2)

5 problems from Codeforces Round 147 (Div. 2) (contest 237), difficulty 1000-2000. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 147 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1000-2000 | 15m 38s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Free Cash	1000	implementation	29,521	3m 27s	✓
B	Young Table	1500	implementation, sortings	2,376	3m 3s
C	Primes on Interval	1600	binary-search, number-theory, two-pointers	6,643	2m 42s	✓
D	T-decomposition	2000	dfs-and-similar, graphs, greedy	618	2m 57s	✓
E	Build String	2000	flows, graphs	2,004	3m 29s	✓

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

CF 237C - Primes on Interval

We are given an interval of integers from a to b. We want to choose a length l such that every contiguous segment of length l inside this interval contains at least k prime numbers. Among all lengths that satisfy this condition, we need the smallest one.

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

CF 237B - Young Table

We are given a triangular table of numbers. Each row has fewer or equal cells than the row above it, forming a structure like a Young tableau. Every cell contains a distinct integer between 1 and the total number of cells.

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

CF 237E - Build String

We are given a target string t and a set of n source strings s1, s2, ..., sn. The goal is to construct t by repeatedly taking single characters from the source strings.

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

CF 237D - T-decomposition

We are given a tree with $n$ nodes, and our goal is to decompose it into another tree, called a T-decomposition. Each node in this decomposition is a non-empty subset of the original nodes, and we must satisfy three conditions.

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

CF 237A - Free Cash

We are asked to determine how many cash registers Valera needs in his fast-food cafe so that every visitor can be served immediately, assuming each visitor arrives at a specific time during a single day and each service takes less than a minute.