Problem 3886 · Hard

Sum of Sortable Integers

Split an array into equal blocks for each divisor k of its length, rotate each block freely, and add up the divisors that can finish sorted.

Open the interactive visualisation