CodeCraft-20 (Div. 2)

3 problems from CodeCraft-20 (Div. 2) (contest 1316), difficulty 1400-2800. 2/3 solutions verified against sample I/O.

3 items

CodeCraft-20 (Div. 2)

Div. 2 | 3 problems | 2/3 verified | Difficulty 1400-2800 | 8m 54s

#	Problem	Rating	Tags	Accepted	Time	✓
B	String Modification	1400	brute-force, constructive-algorithms, implementation	11,723	2m 8s
C	Primitive Primes	1800	constructive-algorithms, math, ternary-search	7,592	1m 51s	✓
F	Battalion Strength	2800	data-structures, divide-and-conquer, probabilities	894	4m 55s	✓

Practice › Codeforces Solutions › CodeCraft-20 (Div. 2) ›

CF 1316F - Battalion Strength

We are given a list of officers, each with a numerical power. From these officers, a battalion is formed by choosing any subset uniformly at random, including the empty set.

Practice › Codeforces Solutions › CodeCraft-20 (Div. 2) ›

CF 1316B - String Modification

We are given a string of length $n$, and Vasya wants to perform a sequence of substring reversals to produce the lexicographically smallest string possible. The operation is controlled by an integer $k$, which specifies the length of each consecutive substring to reverse.

Practice › Codeforces Solutions › CodeCraft-20 (Div. 2) ›

CF 1316C - Primitive Primes

We are given two polynomials, each represented by an array of positive integers, which are their coefficients. The first polynomial has $n$ terms and coefficients $a0, a1, dots, a{n-1}$, the second has $m$ terms with coefficients $b0, b1, dots, b{m-1}$.