Subset query

CodeChefOpen on judge ↗

Given a set of N natural numbers 1,2,3........N and Q query.For each query you have to calculate the total number of subset in which Ith. number of set come at Kth postion.Elements of every subset should be in sorted order. The answer could be very large so you have to print answer modulo 1e9+7. Input: - The first line of input cotains a single integer T denoting the number of test cases. - F

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