Codeforces Round 1083 (Div. 2)

7 problems from Codeforces Round 1083 (Div. 2) (contest 2205), difficulty 800-3000. 1/7 solutions verified against sample I/O.

7 items

Codeforces Round 1083 (Div. 2)

Div. 2 | 7 problems | 1/7 verified | Difficulty 800-3000 | 15m 10s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Simons and Making It Beautiful	800	brute-force, constructive-algorithms	17,265	2m 25s
B	Simons and Cakes for Success	800	implementation, math	16,138	2m 21s	✓
C	Simons and Posting Blogs	1500	greedy, sortings	7,702	1m 56s
D	Simons and Beating Peaks	1700	data-structures, divide-and-conquer, dp	4,902	2m
E	Simons and Dividing the Rhythm	2100	combinatorics, data-structures, dp	1,562	2m 21s
F	Simons and Reconstructing His Roads	2400	constructive-algorithms, data-structures, dsu	636	2m 19s
G	Simons and Diophantus Equation	3000	bitmasks, brute-force, data-structures	204	1m 48s

Practice › Codeforces Solutions › Codeforces Round 1083 (Div. 2) ›

CF 2205G - Simons and Diophantus Equation

We are asked to count the number of ordered triples of integers $(i, j, k)$ in the range $[0, m]$ such that the equation $(i oplus j) cdot x + (j oplus k) cdot y = n$ has an integer solution for $x$ and $y$. Here $oplus$ is the bitwise XOR.

Practice › Codeforces Solutions › Codeforces Round 1083 (Div. 2) ›

CF 2205F - Simons and Reconstructing His Roads

We are given a rectangular grid representing a city, with intersections at coordinates $(i,j)$. Streets only exist between neighboring intersections, either horizontally or vertically. Each street has an integer weight and may or may not be allowed for reconstruction.

Practice › Codeforces Solutions › Codeforces Round 1083 (Div. 2) ›

CF 2205E - Simons and Dividing the Rhythm

We are asked to count how many arrays $S$ exist such that, after a single sequence of independent subarray reversals, the resulting array equals a given array $T$.

Practice › Codeforces Solutions › Codeforces Round 1083 (Div. 2) ›

CF 2205D - Simons and Beating Peaks

We are asked to transform a permutation of integers into a "cool" array. An array is cool if no element in the middle of a triplet is the maximum among its neighbors. In other words, the array must have no peaks, where a peak is a value larger than both its immediate neighbors.

Practice › Codeforces Solutions › Codeforces Round 1083 (Div. 2) ›

CF 2205A - Simons and Making It Beautiful

We are given a permutation p of length n. An index i is called ugly if it is the first time the maximum value is reached at that position. More formally, i is ugly if p[i] is equal to the maximum of p[1..i].

Practice › Codeforces Solutions › Codeforces Round 1083 (Div. 2) ›

CF 2205B - Simons and Cakes for Success

We are asked to help Simons divide cakes among his friends. More formally, for a given number of friends $n$, we need to find the smallest positive integer $k$ such that $k^n$ is divisible by $n$. The input consists of multiple test cases, each specifying the number of friends.

Practice › Codeforces Solutions › Codeforces Round 1083 (Div. 2) ›

CF 2205C - Simons and Posting Blogs

We are given several independent scenarios. In each one, there are several “blogs”, and each blog contains an ordered list of user IDs.