olymmath

TUYMAADA 2022 J6

  • Junior

The city of Neverreturn has NN bus stops numbered 1,2,⋯ ,N.1, 2, \cdots , N. Each bus route is one-way and has only two stops, the beginning and the end. The route network is such that departing from any stop one cannot return to it using city buses. When the mayor notices a route going from a stop with a greater number to a stop with a lesser number, he orders to exchange the number plates of its beginning and its end. Can the plate changing go on infinitely? (K. Ivanov )

Dataset text AI-MO AoPS. 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.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator tuymaada/2022/j6 · Tag JJM31Q6WJQ · Edit this page on GitHub · Keys: j next, k previous