Codeforces Round 552 (Div. 3)

Solutions for Codeforces Round 552 (Div. 3) (contest 1154). 5/7 problems verified against sample I/O. Difficulty range: 800-2200.

7 items

Codeforces Round 552 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 5/7 | Rating range: 800-2200 | Time: 9m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Restoring Three Numbers	800	math	1m 31s	✗
B	Make Them Equal	1200	math	43s	✗
C	Gourmet Cat	1400	implementation, math	1m 30s	✓
D	Walking Robot	1500	greedy	1m 15s	✓
E	Two Teams	1800	data-structures, implementation, sortings	1m 58s	✓
F	Shovels Shop	2100	dp, greedy, sortings	1m 23s	✓
G	Minimum Possible LCM	2200	brute-force, greedy, math	1m 13s	✓

Practice › Codeforces Solutions › Codeforces Round 552 (Div. 3) ›

CF 1154E - Two Teams

We are given a row of n students, each with a distinct programming skill ranging from 1 to n. Two coaches take turns picking students to form their teams. On a coach's turn, they select the student with the highest skill remaining in the row.

Practice › Codeforces Solutions › Codeforces Round 552 (Div. 3) ›

CF 1154G - Minimum Possible LCM

We are given an array of integers and asked to find a pair of indices (i, j) such that the least common multiple (LCM) of the two numbers at these indices is as small as possible. The array can contain up to one million elements, and each number can be as large as ten million.

Practice › Codeforces Solutions › Codeforces Round 552 (Div. 3) ›

CF 1154F - Shovels Shop

We have a shop with n shovels, each with a specific price. Misha wants to buy exactly k shovels, possibly in multiple purchases. The twist is that the shop offers special deals: if you buy exactly xj shovels in a single purchase, the yj cheapest among those shovels are free.

Practice › Codeforces Solutions › Codeforces Round 552 (Div. 3) ›

CF 1154D - Walking Robot

We control a robot that starts at position 0 on a one-dimensional axis and must try to walk up to position n. The robot has two power sources: a battery with capacity b and an accumulator (charged by a solar panel) with capacity a.

Practice › Codeforces Solutions › Codeforces Round 552 (Div. 3) ›

CF 1154A - Restoring Three Numbers

We are given four numbers that represent three pairwise sums of unknown positive integers $a$, $b$, $c$ and the sum of all three numbers. These four numbers are in no particular order. Our task is to reconstruct the original three integers $a$, $b$, $c$ from these sums.

Practice › Codeforces Solutions › Codeforces Round 552 (Div. 3) ›

CF 1154C - Gourmet Cat

Polycarp has a cat with a strict weekly eating schedule. The cat consumes fish food on Mondays, Thursdays, and Sundays; rabbit stew on Tuesdays and Saturdays; and chicken stakes on Wednesdays and Fridays.

Practice › Codeforces Solutions › Codeforces Round 552 (Div. 3) ›

CF 1154B - Make Them Equal

We are given an array of integers. We must choose a single non-negative value D and then, independently for each element, either add D, subtract D, or leave it unchanged. The goal is to make every element become the same value after these operations.