Ural Championship 2017

13 problems from Ural Championship 2017 (contest 105582), difficulty -. 13/13 solutions verified against sample I/O.

13 items

Ural Championship 2017

Special | 13 problems | 13/13 verified | Difficulty - | 12m 52s

# Problem Rating Tags Accepted Time ✓
A Apple 59s ✓
B Bar charts 49s ✓
C Constructor 1m 5s ✓
D Dinner Party 1m 8s ✓
E Expressions of Dice 1m 3s ✓
F Flight Trip 1m 1s ✓
G Glasses of Solutions 1m 5s ✓
H Hamburgers 1m 3s ✓
I Intricate Path 52s ✓
J Jumping Through Hyperspace 1m 11s ✓
K King's Island 44s ✓
L Lexica 50s ✓
M Maximum Paths 1m 2s ✓
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582J - Jumping Through Hyperspace

We are given a directed complete graph of planets where each ordered pair of planets may or may not have a hyperjump available.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582E - Expressions of Dice

The task is interactive and is not about computing an answer from a fixed input. Instead, we are gradually building a pool of symbols by repeatedly choosing one of six dice types, rolling it, and observing a randomly returned symbol.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582M - Maximum Paths

The structure is a complete binary tree where every node from 2 onward has a parent given by integer division by two. This makes the topology fixed and implicit: node 1 is the root, node 2 and 3 are its children, node 4 to 7 are next level, and so on up to n.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582G - Glasses of Solutions

We are given several containers, each containing a liquid solution. For each container we know two values: the total mass of the solution and how much of that mass is salt.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582A - Apple

We are given an undirected simple graph with at most 100 vertices and 100 edges. The task is not to “draw” anything geometrically in a computational sense, but to decide whether this graph can be interpreted as a very specific structure called an apple.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582L - Lexica

We are given a square board of size (n+2) × (n+2) where the inner region corresponds to a crossword-like grid. Some inner cells are active, marked with dots, and the rest are blocked. The active cells form a connected structure where we need to place letter tiles.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582H - Hamburgers

We are given several groups of friends, and for each group we want to choose a cafe that makes as many people in that group happy as possible. Each person has a preference described by a small set of ingredients, encoded as a short string.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582I - Intricate Path

We are asked to construct a small grid world that behaves like a controllable maze for a robot. The grid has three types of cells: empty space, obstacles, and a single starting cell for the robot.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582D - Dinner Party

We are given a pile of identical square tables, each representing a unit square tile. We must use all of these tiles to build one or more rectangular “large tables”. Each large table is formed by arranging some number of unit squares into a perfect axis-aligned rectangle.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582C - Constructor

We are given several types of construction parts. Each type has a fixed mass and a limited supply. From these parts we want to assemble several identical kits. “Identical” means every kit uses exactly the same number of parts of each type.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582K - King's Island

We are asked to construct a simple polygon with exactly n vertices, where n is at most 30. Each vertex must lie on integer coordinates inside a bounded grid.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582F - Flight Trip

We are flying on a sphere where the only reliable sensor is a stream of local time values. The target is a fixed geographic point given in latitude and longitude, and the goal is to physically reach it with very high precision.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Ural Championship 2017 ›

CF 105582B - Bar charts

We are given two ways of describing histograms built from the same underlying sorted data set. Each description splits the number line into equal-width intervals and counts how many elements of the hidden array fall into each interval.
codeforces competitive-programming Jun 22, 2026