← All problemsSign in

Aakash and Maths

Aakash is very good at maths. But his friend Arav doesn't think so. So to challenge him, he gives him a problem. He gives him an integer an $L$ and asks him to find the number of arrangements of integers $1$ to $L$ such that each arrangement satisfies the following property: Let the arrangement be: $A_1,A_2,....,A_L.$ The arrangement should be such that there exists a $R$ $(2 ≤ R ≤ L-1)$ such tha

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