Codeforces Round 112 (Div. 2)

Solutions for Codeforces Round 112 (Div. 2) (contest 165). 4/5 problems verified against sample I/O. Difficulty range: 1000-2200.

5 items

Codeforces Round 112 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1000-2200 | Time: 8m 54s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Supercentral Point	1000	implementation	1m 52s	✗
B	Burning Midnight Oil	1500	binary-search, implementation	1m 42s	✓
C	Another Problem on Strings	1600	binary-search, brute-force, dp	1m 20s	✓
D	Beard Graph	2100	data-structures, dsu, trees	2m 13s	✓
E	Compatible Numbers	2200	bitmasks, brute-force, dfs-and-similar	1m 47s	✓

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

CF 165A - Supercentral Point

We are given a set of points on a 2D Cartesian plane. A point is called supercentral if there exists at least one other point directly to its left, one directly to its right, one directly above it, and one directly below it.

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

CF 165B - Burning Midnight Oil

Vasya has to write at least n lines of code during one night. He starts with productivity v, meaning he writes v lines before the first tea break. After every break, his productivity drops by a factor of k, using integer division.

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

CF 165C - Another Problem on Strings

We are asked to count substrings of a binary string that contain exactly k ones. A substring is any contiguous sequence of characters within the string, and different occurrences at different positions count separately.

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

CF 165D - Beard Graph

The graph in this problem is almost a simple path. Every vertex has degree at most 2, except possibly one special vertex that may have larger degree. A tree with this shape looks like several chains glued together at one center. Initially every edge is black.

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

CF 165E - Compatible Numbers

We are given an array of integers, and for every element we must find another array element whose bitwise AND with it is zero. Two numbers are compatible exactly when they do not share any bit set to 1.