olymmath

KöMaL 2024 K824

    Starting from the string of letters ABABABABABAB, in each step we can swap two adjacent letters. Find the minimum number of steps needed to obtain the string of letters AAAAAABBBBBB.

    Official text KöMaL. 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 hu-komal/2024/k824 · Tag F7TP88CY6P · Edit this page on GitHub · Keys: j next, k previous