Educational Codeforces Round 83 (Rated for Div. 2)

4 problems from Educational Codeforces Round 83 (Rated for Div. 2) (contest 1312), difficulty 1000-2600. 0/4 solutions verified against sample I/O.

4 items

Educational Codeforces Round 83 (Rated for Div. 2)

Div. 2 | 4 problems | 0/4 verified | Difficulty 1000-2600 | 9m 40s

#	Problem	Rating	Tags	Accepted	Time
B	Bogosort	1000	constructive-algorithms, sortings	39,027	4m 47s
C	Adding Powers	1400	bitmasks, greedy, implementation	18,342	1m 8s
D	Count the Arrays	1700	combinatorics, math	10,525	2m 54s
G	Autocompletion	2600	data-structures, dfs-and-similar, dp	1,081	51s

Practice › Codeforces Solutions › Educational Codeforces Round 83 (Rated for Div. 2) ›

CF 1312B - Bogosort

We are given an array of integers and are allowed to permute it arbitrarily. After rearranging, we assign each value to a position starting from 1. The array is considered valid if no two positions share the same value of the expression i - a[i].

Practice › Codeforces Solutions › Educational Codeforces Round 83 (Rated for Div. 2) ›

CF 1312D - Count the Arrays

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.

Practice › Codeforces Solutions › Educational Codeforces Round 83 (Rated for Div. 2) ›

CF 1312G - Autocompletion

We are given a rooted construction of many strings where every node represents a string and every edge corresponds to appending one character. The root is the empty string, and each node i is created by taking its parent string pi and appending a lowercase letter ci.

Practice › Codeforces Solutions › Educational Codeforces Round 83 (Rated for Div. 2) ›

CF 1312C - Adding Powers

We are given an array of non-negative integers, and a base $k ge 2$. Starting from an array of zeroes of the same length, we can repeatedly pick a step $i$ and add $k^i$ to any single element of the array, or skip the step.