Subsequence-Numbers Divisible by 7

CodeChefRating 1943Open on judge ↗

Kulyash has given you an array $A$ of size $N$. He defines the *subsequence-number* of a **non-empty** [subsequence](https://en.wikipedia.org/wiki/Subsequence) $S$ of array $A$ as the number formed by the **concatenation** of all the elements of the subsequence $S$. Find the count of non-empty subsequences of $A$ having their *subsequence-numbers* **divisible** by $7$. Since the answer can be

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