Codeforces Round 153 (Div. 1)

Solutions for Codeforces Round 153 (Div. 1) (contest 251). 2/5 problems verified against sample I/O. Difficulty range: 1300-3000.

5 items

Codeforces Round 153 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 2/5 | Rating range: 1300-3000 | Time: 26m 57s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Points on Line	1300	binary-search, combinatorics, two-pointers	1m 9s	✓
B	Playing with Permutations	1800	implementation, math	8m 15s	✗
C	Number Transformation	2000	dp, greedy, number-theory	14m 23s	✗
D	Two Sets	2700	bitmasks, math	1m 13s	✓
E	Tree and Table	3000	dfs-and-similar, dp, implementation	1m 57s	✗

Practice › Codeforces Solutions › Codeforces Round 153 (Div. 1) ›

CF 251A - Points on Line

We are given a set of points positioned along a one-dimensional line. Petya wants to count how many triplets of points can be chosen such that the distance between the leftmost and rightmost points in the triplet does not exceed a given value d.

Practice › Codeforces Solutions › Codeforces Round 153 (Div. 1) ›

CF 251B - Playing with Permutations

Codeforces 251B: Playing with Permutations

Practice › Codeforces Solutions › Codeforces Round 153 (Div. 1) ›

CF 251C - Number Transformation

Codeforces 251C: Number Transformation

Practice › Codeforces Solutions › Codeforces Round 153 (Div. 1) ›

CF 251D - Two Sets

We are given a sequence of non-negative integers and must split it into two groups. One group remains with Petya and the other is given to Masha. For each group we compute the XOR of all numbers assigned to it, and we call these values x1 and x2.

Practice › Codeforces Solutions › Codeforces Round 153 (Div. 1) ›

CF 251E - Tree and Table

We are given a tree with $2n$ nodes, and the goal is to place each node into a 2-row by $n$-column table so that each edge of the tree connects two cells sharing a side. Each node occupies exactly one cell, and each cell contains exactly one node.