Codeforces Round 549 (Div. 2)

Solutions for Codeforces Round 549 (Div. 2) (contest 1143). 3/3 problems verified against sample I/O. Difficulty range: 800-1400.

3 items

Codeforces Round 549 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 800-1400 | Time: 4m 13s

Problem	Name	Rating	Tags	Solve Time	Verified
A	The Doors	800	implementation	1m 11s	✓
B	Nirvana	1200	brute-force, math, number-theory	1m 36s	✓
C	Queen	1400	dfs-and-similar, trees	1m 26s	✓

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

CF 1143B - Nirvana

We are asked to find, for a given integer $n$, the largest product of digits that any number from 1 to $n$ can have. In other words, imagine iterating through all numbers from 1 up to $n$ and multiplying the digits of each number; we want the maximum such product.

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

CF 1143C - Queen

We are given a rooted tree with n vertices. Each vertex has a parent pi and a respect indicator ci. The root is special: it has pi = -1 and ci = 0.

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

CF 1143A - The Doors

The problem can be restated as follows. Mr. Black has a house with two sets of doors, each leading to a separate exit: left and right. Each door is initially closed, and we know the exact sequence in which Mr. Black opens them.