Technocup 2019 - Elimination Round 1

7 problems from Technocup 2019 - Elimination Round 1 (contest 1030), difficulty 800-2900. 4/7 solutions verified against sample I/O.

7 items

Technocup 2019 - Elimination Round 1

Special | 7 problems | 4/7 verified | Difficulty 800-2900 | 30m 17s

#	Problem	Rating	Tags	Accepted	Time	✓
A	In Search of an Easy Problem	800	implementation	171,367	3m 6s	✓
B	Vasya and Cornfield	1100	geometry	13,225	5m 15s	✓
C	Vasya and Golden Ticket	1300	implementation	9,923	3m 44s	✓
D	Vasya and Triangle	1800	geometry, number-theory	6,253	4m 52s
E	Vasya and Good Sequences	2000	bitmasks, dp	3,350	4m 57s
F	Putting Boxes Together	2500	data-structures	905	5m 52s
G	Linear Congruential Generator	2900	number-theory	398	2m 31s	✓

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 1 ›

CF 1030F - Putting Boxes Together

We are given a fixed line of cells where each box sits at a distinct integer coordinate. Each box also has a weight, and that weight determines how expensive it is to move that box one step left or right.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 1 ›

CF 1030G - Linear Congruential Generator

We are given a system that evolves an $n$-dimensional vector over discrete steps. Each coordinate evolves independently using the same type of rule: a linear transformation modulo a prime.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 1 ›

CF 1030E - Vasya and Good Sequences

We are given an array of integers, and we need to count how many contiguous subarrays have a special property. A subarray is considered valid if we can “rearrange bits inside each number independently” by swapping any two bits in its binary representation any number of…

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 1 ›

CF 1030D - Vasya and Triangle

We are working inside an integer grid that forms a rectangle from the origin to the point $(n,m)$. We need to pick three lattice points inside or on the border of this rectangle and form a triangle whose area is exactly $frac{nm}{k}$.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 1 ›

CF 1030B - Vasya and Cornfield

The task is to classify points in a plane relative to a fixed geometric region defined by four boundary points: $(0, d)$, $(d, 0)$, $(n, n-d)$, and $(n-d, n)$.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 1 ›

CF 1030C - Vasya and Golden Ticket

We are given a sequence of digits written as a single string. The task is to decide whether we can split this sequence into several consecutive parts, at least two parts, such that every part has exactly the same sum of digits.

Practice › Codeforces Solutions › Technocup 2019 - Elimination Round 1 ›

CF 1030A - In Search of an Easy Problem

We are given a small group of people, each giving a binary opinion about a single problem. Each response is either 0, meaning the person considers the problem easy, or 1, meaning the person considers it hard.