Codeforces Round 461 (Div. 2)

2 problems from Codeforces Round 461 (Div. 2) (contest 922), difficulty 1300-2400. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 461 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1300-2400 | 2m 23s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Cloning Toys	1300	implementation	12,602	1m 4s	✓
F	Divisibility	2400	constructive-algorithms, dp, greedy	743	1m 19s	✓

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

CF 922F - Divisibility

We are asked to build a subset of the numbers from 1 to n such that a very specific quantity computed on this subset equals k exactly. The quantity counts ordered pairs of distinct elements (a, b) where a appears earlier in value than b and a divides b evenly.

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

CF 922A - Cloning Toys

We start with a single original plush toy and no copies. A machine can be applied repeatedly, and each application changes the inventory depending on what type of toy it is applied to.