Unexpected answer
Source: tournament of towns
December 2, 2019
combinatorics unsolvedalgorithmcombinatoricsKvant
Problem Statement
In each cell, a strip of length is worth a chip. You can change any neighboring chips and pay rouble, and you can also swap any chips for free, between which there are exactly chips. For what is the smallest amount of rubles you can rearrange chips in reverse order?