Codeforces Round 645 (Div. 2)

3 problems from Codeforces Round 645 (Div. 2) (contest 1358), difficulty 1600-2400. 2/3 solutions verified against sample I/O.

3 items

Codeforces Round 645 (Div. 2)

Div. 2 | 3 problems | 2/3 verified | Difficulty 1600-2400 | 12m 19s

#	Problem	Rating	Tags	Accepted	Time	✓
C	Celex Update	1600	math	18,343	2m	✓
D	The Best Vacation	1900	binary-search, brute-force, greedy	8,722	5m 45s	✓
E	Are You Fired?	2400	constructive-algorithms, data-structures, greedy	2,451	4m 34s

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

CF 1358D - The Best Vacation

We are given a sequence of months laid out in order, where each month has a fixed length in days. If we flatten the calendar, each day becomes a single linear timeline, but each position still knows its position inside its month, from day 1 up to day $di$.

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

CF 1358E - Are You Fired?

We are effectively given a partially known array of length $n$. The first half (rounded up) is explicitly provided, while the second half is completely uniform and equal to a constant value $x$. So after reading the input, the entire sequence is actually determined.

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

CF 1358C - Celex Update

The problem gives us an infinite two-dimensional table filled with integers in a specific pattern. Each cell at position $(x, y)$ contains a number that can be derived from its coordinates using the “GAZ-GIZ” filling rule.