AIM Tech Round 5 (rated, Div. 1 + Div. 2)

8 problems from AIM Tech Round 5 (rated, Div. 1 + Div. 2) (contest 1028), difficulty 800-3000. 3/8 solutions verified against sample I/O.

8 items

AIM Tech Round 5 (rated, Div. 1 + Div. 2)

Div. 1+2 | 8 problems | 3/8 verified | Difficulty 800-3000 | 21m 57s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Find Square	800	implementation	11,517	1m 44s	✓
B	Unnatural Conditions	1200	constructive-algorithms, math	10,234	2m 29s
C	Rectangles	1600	geometry, implementation, sortings	5,050	2m 30s	✓
D	Order book	2100	combinatorics, data-structures, greedy	1,822	2m 46s
E	Restore Array	2400	constructive-algorithms	1,202	3m 9s
F	Make Symmetrical	2900	brute-force	580	2m 1s	✓
G	Guess the number	3000	dp, interactive	646	3m 33s
H	Make Square	2900	math	564	3m 45s

Practice › Codeforces Solutions › AIM Tech Round 5 (rated, Div. 1 + Div. 2) ›

CF 1028H - Make Square

We are given a long array, and we repeatedly answer queries on subsegments of it. For each query range, we are allowed to slightly modify numbers in that segment by multiplying or dividing by primes, where each such operation changes a number by a single prime factor.

Practice › Codeforces Solutions › AIM Tech Round 5 (rated, Div. 1 + Div. 2) ›

CF 1028G - Guess the number

We are trying to identify an unknown integer $x$ in a very large range from $1$ to $M = 10004205361450474$. Instead of asking direct yes or no questions, we are allowed to submit up to five queries, where each query is an increasing list of integers.

Practice › Codeforces Solutions › AIM Tech Round 5 (rated, Div. 1 + Div. 2) ›

CF 1028E - Restore Array

We are given a cyclic structure of length $n$, where each position in the hidden array $a$ produces an observed value $bi$ through a modulo operation with its next neighbor.

Practice › Codeforces Solutions › AIM Tech Round 5 (rated, Div. 1 + Div. 2) ›

CF 1028F - Make Symmetrical

We maintain a dynamic set of points on the integer grid. The set changes over time through insertions and deletions.

Practice › Codeforces Solutions › AIM Tech Round 5 (rated, Div. 1 + Div. 2) ›

CF 1028D - Order book

We are given a chronological log of events in a trading system where orders are inserted and then later executed. Each order has a unique price and, when it is created, it could be either a buy order or a sell order, but this direction is not recorded in the log.

Practice › Codeforces Solutions › AIM Tech Round 5 (rated, Div. 1 + Div. 2) ›

CF 1028B - Unnatural Conditions

We are asked to construct two positive integers, call them $a$ and $b$, such that their digit sums are both large enough, while the digit sum of their sum is kept small.

Practice › Codeforces Solutions › AIM Tech Round 5 (rated, Div. 1 + Div. 2) ›

CF 1028C - Rectangles

We are given a collection of axis-aligned rectangles on a 2D integer grid. Each rectangle is described by its bottom-left corner and top-right corner, and it includes its boundary as well as its interior.

Practice › Codeforces Solutions › AIM Tech Round 5 (rated, Div. 1 + Div. 2) ›

CF 1028A - Find Square

We are given a grid of size $n times m$ consisting of two types of cells, white and black. Initially the entire grid is white, but at some point a single square region with an odd side length was painted black. That square is axis-aligned and fully filled with black cells.