Codeforces Round 613 (Div. 2)

5 problems from Codeforces Round 613 (Div. 2) (contest 1285), difficulty 800-2900. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 613 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 800-2900 | 19m 38s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Mezo Playing Zoma	800	math	29,887	2m 58s
B	Just Eat It!	1300	dp, greedy, implementation	30,811	2m 9s	✓
D	Dr. Evil Underscores	1900	bitmasks, brute-force, dfs-and-similar	8,609	8m 56s	✓
E	Delete a Segment	2300	brute-force, constructive-algorithms, data-structures	2,000	3m 14s
F	Classical?	2900	binary-search, combinatorics, number-theory	1,356	2m 21s	✓

Practice › Codeforces Solutions › Codeforces Round 613 (Div. 2) ›

CF 1285D - Dr. Evil Underscores

We are given a list of integers, and we are allowed to choose a single integer $X$. Once $X$ is fixed, every array value is transformed by XOR with $X$, and we care about the largest transformed value. The goal is to pick $X$ so that this maximum value is as small as possible.

Practice › Codeforces Solutions › Codeforces Round 613 (Div. 2) ›

CF 1285E - Delete a Segment

We are given several intervals on a number line. Each interval represents a continuous segment of covered points. If multiple intervals overlap or touch, their combined covered region merges into a single continuous piece when we take the union.

Practice › Codeforces Solutions › Codeforces Round 613 (Div. 2) ›

CF 1285F - Classical?

We are given a list of positive integers and we want to choose two different positions in the list such that the least common multiple of the chosen values is as large as possible.

Practice › Codeforces Solutions › Codeforces Round 613 (Div. 2) ›

CF 1285A - Mezo Playing Zoma

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…

Practice › Codeforces Solutions › Codeforces Round 613 (Div. 2) ›

CF 1285B - Just Eat It!

We have an array representing the tastiness of cupcakes, and two players. Yasser always takes all the cupcakes, summing up the full array. Adel can pick any contiguous subarray that does not cover the entire array.