RU-ALLRUSSIAN 1986 Problem 4
Given n points can one build n- 1 roads, so that each road joins two points, the shortest distance between any two points along the roads belongs to {1, 2, 3, ..., n(n- 1)/2 }, and given any element of {1, 2, 3, ..., n(n- 1)/2 } one can find two points such that the shortest distance between them along the roads is that element?
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.