Codeforces Round 460 (Div. 2)

5 problems from Codeforces Round 460 (Div. 2) (contest 919), difficulty 800-2600. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 460 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 800-2600 | 38m 35s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Supermarket	800	brute-force, greedy, implementation	16,956	4m 31s	✓
B	Perfect Number	1100	binary-search, brute-force, dp	31,602	1m 34s	✓
C	Seat Arrangements	1300	brute-force, implementation	9,429	13m 52s	✓
D	Substring	1700	dfs-and-similar, dp, graphs	12,247	12m 47s	✓
F	A Game With Numbers	2600	games, graphs, shortest-paths	387	5m 51s	✓

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

CF 919A - Supermarket

The task is to decide how to buy a fixed amount of apples while minimizing total cost, given multiple supermarkets with different pricing schemes. Each supermarket does not directly give a per-kilogram price.

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

CF 919F - A Game With Numbers

We are given a two-player game where Alice and Bob each hold 8 cards with numbers from 0 to 4. On a player’s turn, they select one of their cards with a non-zero number and one of the opponent’s cards with a non-zero number, add them modulo 5, and replace their own card with…

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

CF 919C - Seat Arrangements

We are given a classroom represented as a grid. Each cell is either empty (.) or occupied (). We want to seat exactly k students in a straight line. The seats must be consecutive and must lie entirely within a single row or entirely within a single column.

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

CF 919D - Substring

We are given a directed graph where each vertex carries a lowercase letter. A valid walk follows directed edges from node to node, and we are allowed to revisit nodes and edges as long as we respect direction.

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

CF 919B - Perfect Number

A positive integer is called perfect when the sum of all of its decimal digits is exactly 10. We are given an integer k, and we must output the k-th smallest positive integer whose digit sum equals 10. The ordering is the usual numerical ordering.