← All problemsSign in

Sortable Subarrays (Easy)

CodeChefRating 1830Open on judge ↗

**This is the easy version of the problem. Here $N \le 50$ and sum of $N \le 500$.** An array $A$ is called *sortable* if it can be sorted in **strictly ascending order** with the use of the following operation any number of times: - Choose index $i$ and a **positive integer** $X$, and then update $A_i$ to $A_i \mod X$. Strictly ascending order means that $A_1 < A_2 < \ldots < A_{|A|}$. ---

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start