Codeforces Round 181 (Div. 2)

Solutions for Codeforces Round 181 (Div. 2) (contest 300). 2/3 problems verified against sample I/O. Difficulty range: 1500-2300.

3 items

Codeforces Round 181 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 1500-2300 | Time: 5m 24s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Coach	1500	brute-force, dfs-and-similar, graphs	2m 18s	✓
D	Painting Square	2300	dp, fft	1m 49s	✗
E	Empire Strikes Back	2300	binary-search, math, number-theory	1m 17s	✓

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

CF 300B - Coach

We can think of the students as vertices of an undirected graph. Every friendship relation means two students must belong to the same team. Since each team has exactly three students, every connected component of this graph must fit entirely inside one team.

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

CF 300D - Painting Square

We are asked to count the number of distinct ways to perform exactly k painting moves on an n×n table with a black border.

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

CF 300E - Empire Strikes Back

The problem asks us to determine the minimum positive integer $n$ such that the factorial of $n$, divided by the sum of the factorials of $n - ai$ for a given sequence of integers $a1, a2, dots, ak$, results in a positive integer.