Play with binary

CodeChefOpen on judge ↗

Given an integer N , you have to perform q queries . In each query you need to find out total no. of N bit numbers in binary representation such that there are atmost k 1's in their binary representation . Since the number can be very large you need to output the number modulo 1000000007. Input First line consists of atwo space seperated integers N and Q. Next Q lines consists of single intege

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