Codeforces Round 647 (Div. 1) - Thanks, Algo Muse!

5 problems from Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! (contest 1361), difficulty 1700-3000. 1/5 solutions verified against sample I/O.

5 items

Codeforces Round 647 (Div. 1) - Thanks, Algo Muse!

Div. 1 | 5 problems | 1/5 verified | Difficulty 1700-3000 | 19m 19s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Johnny and Contribution	1700	constructive-algorithms, graphs, greedy	8,841	4m 7s	✓
B	Johnny and Grandmaster	1900	greedy, implementation, math	3,857	1m 12s
C	Johnny and Megan's Necklace	2500	binary-search, bitmasks, constructive-algorithms	1,834	6m 34s
D	Johnny and James	2900	greedy, implementation, math	340	4m 33s
E	James and the Chase	3000	dfs-and-similar, graphs, probabilities	987	2m 53s

Practice › Codeforces Solutions › Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! ›

CF 1361C - Johnny and Megan's Necklace

Each input item is a small “edge gadget” consisting of two pearls, and each pearl has an integer color in the range $[0, 2^{20})$. The goal is to take all these $n$ gadgets and connect their endpoints into one single cycle that uses every pearl exactly once.

Practice › Codeforces Solutions › Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! ›

CF 1361D - Johnny and James

We are given a set of points on the plane, one of which is guaranteed to be the origin. From these points, we must keep exactly k points and delete the rest.

Practice › Codeforces Solutions › Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! ›

CF 1361A - Johnny and Contribution

We are given an undirected graph. Each vertex represents a blog, and every blog has a desired topic number t[i]. Johnny writes blogs one by one. When he writes a blog, he looks only at neighbors that have already been written.

Practice › Codeforces Solutions › Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! ›

CF 1361E - James and the Chase

The exercise asks for a direct algebraic simplification of two displayed identities involving content and primitive part of polynomials over a unique factorization domain $S$.

Practice › Codeforces Solutions › Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! ›

CF 1361B - Johnny and Grandmaster

The exercise asks for a direct algebraic simplification of two displayed identities involving content and primitive part of polynomials over a unique factorization domain $S$.