Codeforces Round 494 (Div. 3)

6 problems from Codeforces Round 494 (Div. 3) (contest 1003), difficulty 800-2200. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 494 (Div. 3)

Div. 3 | 6 problems | 2/6 verified | Difficulty 800-2200 | 11m 26s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Polycarp's Pockets	800	implementation	29,976	1m 15s	✓
B	Binary String Constructing	1300	constructive-algorithms	12,222	1m 51s
C	Intense Heat	1300	brute-force, implementation, math	11,525	1m 30s
D	Coins and Queries	1600	greedy	8,560	1m 58s
E	Tree Constructing	2100	constructive-algorithms, graphs	3,029	3m 34s
F	Abbreviation	2200	dp, hashing, strings	1,601	1m 18s	✓

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

CF 1003E - Tree Constructing

We are asked to build a tree with a fixed number of nodes such that two structural constraints hold simultaneously: the longest simple path in the tree has length exactly d, and every vertex is incident to at most k edges. If no such tree can exist, we must report impossibility.

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

CF 1003D - Coins and Queries

We are given a multiset of coin values, where every coin is a power of two. Each query asks whether we can form a target sum using a subset of these coins, and if so, what the minimum number of coins needed is.

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

CF 1003F - Abbreviation

We are given a document as a sequence of words. The structure is fixed: words are separated by single spaces, so the underlying object is really just an array of strings.

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

CF 1003B - Binary String Constructing

We are asked to construct a binary string made of zeros and ones with two constraints that interact with each other in a nontrivial way. First, the string must contain exactly a zeros and exactly b ones, so the total length is fixed as n = a + b.

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

CF 1003C - Intense Heat

We are given a sequence of daily temperatures and asked to evaluate all contiguous time intervals whose length is at least a given threshold. For each such interval, we compute its average temperature, meaning the sum of its values divided by its length.

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

CF 1003A - Polycarp's Pockets

We are given a multiset of coin values, and we need to place every coin into a collection of “pockets” under a simple restriction: inside any single pocket, no value is allowed to repeat.