Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!]

3 problems from Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] (contest 1068), difficulty 1200-1700. 2/3 solutions verified against sample I/O.

3 items

Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!]

Div. 2 | 3 problems | 2/3 verified | Difficulty 1200-1700 | 17m 32s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Birthday	1400	math	7,261	4m 29s	✓
B	LCM	1200	math, number-theory	13,026	5m 21s	✓
C	Colored Rooks	1700	constructive-algorithms, graphs	3,348	7m 42s

Practice › Codeforces Solutions › Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] ›

CF 1068C - Colored Rooks

We are asked to construct a geometric configuration of colored rooks on a huge grid so that connectivity properties encode a given graph on colors. Each color corresponds to a set of points on a $10^9 times 10^9$ grid. Each point is a rook.

Practice › Codeforces Solutions › Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] ›

CF 1068A - Birthday

We are dealing with a fixed universe of distinct coin types, where there are N possible different coins in total. Ivan already owns K distinct coins from this universe. Now M friends will each give him gifts, and each friend must contribute the same number of coins.

Practice › Codeforces Solutions › Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] ›

CF 1068B - LCM

We are given a single integer $b$, and we conceptually iterate over every positive integer $a$. For each $a$, we compute a value derived from the least common multiple of $a$ and $b$, specifically $frac{mathrm{lcm}(a,b)}{a}$.