7th Love

CodeChefOpen on judge ↗

Alice wants to test Bob's love for the number $7$. Alice gives Bob a sequence of integers $A = [A_1, A_2, \ldots, A_N]$, and $Q$ queries. In each query, she provides an integer $K$ and asks bob to find the number of *lovely* [subsequences](https://en.wikipedia.org/wiki/Subsequence) of size $K$ that can be formed from $A$. A sequence $B$ of length $K$ is called *lovely* if, for every subsequence

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