Codeforces Round 1062 (Div. 4)

7 problems from Codeforces Round 1062 (Div. 4) (contest 2167), difficulty 800-1600. 3/7 solutions verified against sample I/O.

7 items

Codeforces Round 1062 (Div. 4)

Div. 4 | 7 problems | 3/7 verified | Difficulty 800-1600 | 10m 54s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Square?	800	math, sortings	58,391	1m 8s	✓
B	Your Name	800	sortings, strings	51,774	1m 14s	✓
C	Isamatdin and His Magic Wand!	800	constructive-algorithms, greedy, implementation	36,034	1m 33s
D	Yet Another Array Problem	1000	brute-force, implementation, math	30,177	1m 23s	✓
E	khba Loves to Sleep!	1600	binary-search, data-structures, geometry	9,058	1m 52s
F	Tree, TREE!!!	1600	dfs-and-similar, dp, math	7,124	1m 47s
G	Mukhammadali and the Smooth Array	1600	data-structures, dp	11,011	1m 57s

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

CF 2167G - Mukhammadali and the Smooth Array

We are given an integer array and a corresponding cost array. For each position in the array, we can replace its value at a certain cost, and positions we do not change keep their original values.

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

CF 2167F - Tree, TREE!!!

We are given an unrooted tree and a parameter $k$. For every possible choice of a root $r$, we conceptually “re-root” the tree at $r$ and then look at all ways of selecting exactly $k$ distinct nodes.

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

CF 2167E - khba Loves to Sleep!

We are given a one-dimensional segment from 0 to x, and a set of n friends sitting at fixed integer positions on this segment. We are allowed to place k teleport points anywhere on the segment, all at distinct integer positions.

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

CF 2167D - Yet Another Array Problem

Each test case gives a collection of large integers, and the task is to find the smallest integer $x ge 2$ such that at least one element in the array is coprime with $x$.

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

CF 2167C - Isamatdin and His Magic Wand!

We are given several independent test cases. Each test case consists of a sequence of integers representing toys arranged in a line. The only operation allowed is swapping two elements if one is even and the other is odd. Swaps between two evens or two odds are forbidden.

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

CF 2167B - Your Name

We are given two strings, s and t, each of length n. The first string represents a row of lettered cubes, and the second string is a target name. The task is to determine if it is possible to rearrange the letters of s to exactly match t.

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

CF 2167A - Square?

We are given four stick lengths per test case, and we want to know whether these four sticks can be arranged to form the boundary of a square.