Codeforces Round 455 (Div. 2)

6 problems from Codeforces Round 455 (Div. 2) (contest 909), difficulty 1000-2500. 6/6 solutions verified against sample I/O.

6 items

Codeforces Round 455 (Div. 2)

Div. 2 | 6 problems | 6/6 verified | Difficulty 1000-2500 | 37m 14s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Generate Login	1000	brute-force, greedy, sortings	10,356	11m 29s	✓
B	Segments	1300	constructive-algorithms, math	6,761	7m 55s	✓
C	Python Indentation	1800	dp	5,486	3m	✓
D	Colorful Points	2100	data-structures, greedy, implementation	2,105	5m 10s	✓
E	Coprocessor	1900	dfs-and-similar, dp, graphs	2,462	5m 29s	✓
F	AND-permutations	2500	constructive-algorithms	635	4m 11s	✓

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

CF 909B - Segments

We are given an integer $N$. From the points $0, 1, 2, dots, N$ on a number line, consider every possible segment whose endpoints are chosen among these points. That means every pair $(l, r)$ with $0 le l < r le N$ defines a segment.

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

CF 909E - Coprocessor

The program consists of tasks that must be executed in an order consistent with a dependency graph. Each task may depend on earlier tasks, forming a directed acyclic graph where execution is only allowed once all prerequisites are completed.

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

CF 909A - Generate Login

We are asked to construct a login from a user's first and last names by concatenating a non-empty prefix of the first name with a non-empty prefix of the last name.

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

CF 909F - AND-permutations

We must construct two completely different permutations of the numbers 1...N. For the first permutation p, every position i must receive a different value, and the bitwise AND of the position and its assigned value must be exactly zero.

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

CF 909D - Colorful Points

The input is a string where each character represents the color of a point on a line. Adjacent characters correspond to neighboring points. During one operation, every point that has at least one neighboring point of a different color is deleted.

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

CF 909C - Python Indentation

We are given a sequence of program statements. Each statement is either: f , a for statement whose body must contain at least one statement at one indentation level deeper. s , a simple statement that occupies exactly one line and does not create a new block.