← All problemsSign in

Count Sequences

CodeChefRating 1967Open on judge ↗

Given three positive integers N, L and R, find the number of non-decreasing sequences of size at least 1 and at most N, such that each element of the sequence lies between L and R, both inclusive. Print the answer modulo 106+3. Input - First line of input contains T, the number of the test cases. - Each of next T lines contains three space separated integers N, L and R. Output For each test

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