Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov!

3 problems from Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! (contest 1340), difficulty 1500-2400. 0/3 solutions verified against sample I/O.

3 items

Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov!

Div. 1 | 3 problems | 0/3 verified | Difficulty 1500-2400 | 17m 38s

#	Problem	Rating	Tags	Accepted	Time
A	Nastya and Strange Generator	1500	brute-force, data-structures, greedy	13,691	6m 43s
B	Nastya and Scoreboard	1700	bitmasks, dp, graphs	8,310	5m 26s
C	Nastya and Unexpected Guest	2400	dfs-and-similar, dp, graphs	2,416	5m 29s

Practice › Codeforces Solutions › Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! ›

CF 1340A - Nastya and Strange Generator

The process builds a permutation from left to right, but the choice at each step is not based on already placed numbers.

Practice › Codeforces Solutions › Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! ›

CF 1340C - Nastya and Unexpected Guest

We are given a straight road modeled as integer points from 0 to n. Some of these points are special positions called safety islands, including both endpoints. Denis starts at 0 at time zero and wants to reach n as fast as possible.

Practice › Codeforces Solutions › Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! ›

CF 1340B - Nastya and Scoreboard

The previous solution is based on a misunderstanding of the problem. The goal is not to match the sample output exactly. The sample output shows one valid answer among many. The real requirement is: 1. t must be a subsequence of s. 2. 3. s must have the smallest possible period.