SIMPLESET

CodeChefOpen on judge ↗

There is a set consisting of $N$ distinct integers. The $i$-$th$ smallest element in this set is $Si$. We want to divide this set into two sets, $X$ and $Y$, such that: The absolute difference of any two distinct elements in $X$ is $A$ or greater. The absolute difference of any two distinct elements in $Y$ is $B$ or greater. How many ways are there to perform such division, modulo $10^9+7$? Note

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