Codeforces Round 624 (Div. 3)

3 problems from Codeforces Round 624 (Div. 3) (contest 1311), difficulty 800-2200. 0/3 solutions verified against sample I/O.

3 items

Codeforces Round 624 (Div. 3)

Div. 3 | 3 problems | 0/3 verified | Difficulty 800-2200 | 16m 31s

#	Problem	Rating	Tags	Accepted	Time
A	Add Odd or Subtract Even	800	greedy, implementation, math	46,254	1m 38s
C	Perform the Combo	1300	brute-force	16,820	2m 18s
E	Construct the Binary Tree	2200	brute-force, constructive-algorithms, trees	2,723	12m 35s

Practice › Codeforces Solutions › Codeforces Round 624 (Div. 3) ›

CF 1311E - Construct the Binary Tree

We are asked to build a rooted tree on vertices labeled from 1 to n, where vertex 1 is the root. Every vertex except the root has exactly one parent, and each vertex is allowed to have at most two children, so the structure must be a binary tree in the rooted sense.

Practice › Codeforces Solutions › Codeforces Round 624 (Div. 3) ›

CF 1311C - Perform the Combo

We are given a fixed string s that represents a sequence of button presses in a fighting game combo. The player repeatedly attempts to type this entire string from left to right. However, the process is interrupted.

Practice › Codeforces Solutions › Codeforces Round 624 (Div. 3) ›

CF 1311A - Add Odd or Subtract Even

Yes, the inequality $nu(n) le 2^{l(n) - lambda(n)}$ holds for all positive integers $n$. Consider an addition chain of minimal length $l(n)$ and let $lambda(n)$ be the length of a shortest chain consisting only of doubling steps.