HMMT 2017 U29
- Guts
- Answer
Yang has the sequence of integers . He makes 2016 swaps in order, where a swap changes the positions of two integers in the sequence. His goal is to end with . How many different sequences of swaps can Yang do to achieve his goal?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
2017^{2015}
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.