Lyft Level 5 Challenge 2018 - Elimination Round

6 problems from Lyft Level 5 Challenge 2018 - Elimination Round (contest 1033), difficulty 1000-3500. 3/6 solutions verified against sample I/O.

6 items

Lyft Level 5 Challenge 2018 - Elimination Round

Special | 6 problems | 3/6 verified | Difficulty 1000-3500 | 50m 45s

#	Problem	Rating	Tags	Accepted	Time	✓
A	King Escape	1000	dfs-and-similar, graphs, implementation	16,031	4m 19s	✓
B	Square Difference	1100	math, number-theory	11,951	4m 51s	✓
C	Permutation Game	1600	brute-force, dp, games	6,216	11m 39s	✓
D	Divisors	2000	interactive, math, number-theory	2,611	8m 46s
F	Boolean Computer	2800	bitmasks, brute-force, fft	462	15m 35s
G	Chip Game	3500	games	502	5m 35s

Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Elimination Round ›

CF 1033F - Boolean Computer

We are given a collection of up to 30,000 integers, each representable in at most 12 bits. Alongside this, we are given many “bitwise machines”, where each machine defines a transformation from two input numbers into one output number.

Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Elimination Round ›

CF 1033G - Chip Game

We are given several independent piles of chips. Each pile has a large initial size, and two players, Alice and Bob, first choose how many chips they will remove per move, denoted by a and b. After these choices, they play a turn-based game on all piles combined.

Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Elimination Round ›

CF 1033D - Divisors

We are given a collection of integers, each of which is known to be “almost prime structured” in the sense that its number of divisors is very small, between 3 and 5.

Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Elimination Round ›

CF 1033C - Permutation Game

We are given a permutation of values placed on a line of positions from 1 to n. A token starts on any chosen position, and two players alternate moving it.

Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Elimination Round ›

CF 1033B - Square Difference

We start with a large square piece of cloth with side length $a$. From one corner, a smaller square of side $b$ is cut out. The remaining cloth is an L-shaped region whose area is simply the area of the big square minus the area of the removed square, so $a^2 - b^2$.

Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Elimination Round ›

CF 1033A - King Escape

We are given a square chessboard with coordinates from 1 to n in both directions. A queen is fixed at one cell, and it attacks along rows, columns, and diagonals in the usual chess sense.