Codeforces Round 1017 (Div. 4)

8 problems from Codeforces Round 1017 (Div. 4) (contest 2094), difficulty 800-1900. 5/8 solutions verified against sample I/O.

8 items

Codeforces Round 1017 (Div. 4)

Div. 4 | 8 problems | 5/8 verified | Difficulty 800-1900 | 12m 23s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Trippi Troppi	800	strings	56,252	1m 27s	✓
B	Bobritto Bandito	800	brute-force, constructive-algorithms	33,138	1m 50s
C	Brr Brrr Patapim	900	math	30,479	2m 18s
D	Tung Tung Sahur	1100	greedy, strings, two-pointers	23,854	1m 6s	✓
E	Boneca Ambalabu	1200	bitmasks	18,557	1m 9s	✓
F	Trulimero Trulicina	1600	constructive-algorithms	11,411	1m 48s
G	Chimpanzini Bananini	1700	data-structures, implementation, math	7,843	1m 37s	✓
H	La Vaca Saturno Saturnita	1900	binary-search, brute-force, math	3,785	1m 8s	✓

Practice › Codeforces Solutions › Codeforces Round 1017 (Div. 4) ›

CF 2094G - Chimpanzini Bananini

We are asked to maintain an array under three types of operations: appending an element to the end, reversing the array, and performing a cyclic shift that moves the last element to the front.

Practice › Codeforces Solutions › Codeforces Round 1017 (Div. 4) ›

CF 2094F - Trulimero Trulicina

We are asked to fill an $n times m$ grid with integers from $1$ to $k$ in such a way that each number occurs exactly the same number of times and no two adjacent cells contain the same number.

Practice › Codeforces Solutions › Codeforces Round 1017 (Div. 4) ›

CF 2094H - La Vaca Saturno Saturnita

We are given an array a of integers and a hidden function f(k, a, l, r) defined as follows: for each index i from l to r, repeatedly divide k by a[i] as long as it is divisible, then add the resulting k to a running total.

Practice › Codeforces Solutions › Codeforces Round 1017 (Div. 4) ›

CF 2094E - Boneca Ambalabu

We are given a sequence of integers, and for each element in the sequence, we can compute the sum of XORs between it and every other element. Our task is to find which element maximizes this sum. More concretely, for a sequence a = [a1, a2, ...

Practice › Codeforces Solutions › Codeforces Round 1017 (Div. 4) ›

CF 2094D - Tung Tung Sahur

We are given a recorded sequence of intended drum hits, where each character is either a left hit or a right hit. Each intended hit does not produce a fixed sound length.

Practice › Codeforces Solutions › Codeforces Round 1017 (Div. 4) ›

CF 2094C - Brr Brrr Patapim

We are given an $n times n$ grid that was generated from an unknown permutation $p$ of length $2n$. The construction rule is simple: the value in cell $(i,j)$ is $p{i+j}$.

Practice › Codeforces Solutions › Codeforces Round 1017 (Div. 4) ›

CF 2094B - Bobritto Bandito

We are asked to track the spread of an infection along an infinite line of houses. The infection starts at house 0 on day 0, and each day it spreads to exactly one additional house that is adjacent to any currently infected house.

Practice › Codeforces Solutions › Codeforces Round 1017 (Div. 4) ›

CF 2094A - Trippi Troppi

Each test case describes a “country name” that is stored in an older format consisting of three separate words.