Codeforces Round 660 (Div. 2)

3 problems from Codeforces Round 660 (Div. 2) (contest 1388), difficulty 800-2000. 2/3 solutions verified against sample I/O.

3 items

Codeforces Round 660 (Div. 2)

Div. 2 | 3 problems | 2/3 verified | Difficulty 800-2000 | 9m 23s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Captain Flint and Crew Recruitment	800	brute-force, greedy, math	25,953	4m 57s
B	Captain Flint and a Long Voyage	1000	greedy, math	22,819	2m 12s	✓
D	Captain Flint and Treasure	2000	data-structures, dfs-and-similar, graphs	6,910	2m 14s	✓

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

CF 1388A - Captain Flint and Crew Recruitment

We are given multiple independent queries, each asking whether a target number can be broken into four distinct positive integers.

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

CF 1388D - Captain Flint and Treasure

We are given a directed structure over indices from 1 to n, where each index i has a value a[i] and a pointer b[i]. The pointer either leads to another index or is absent (represented by -1).

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

CF 1388B - Captain Flint and a Long Voyage

We need to construct an $n$-digit decimal number $x$. Take every digit of $x$, write its binary representation without leading zeroes, and concatenate those binary strings. The resulting binary string is called $k$. After that, the last $n$ bits of $k$ are removed.