Number of Subsequences

CodeChefOpen on judge ↗

Given an array of numbers, find out number of subsequence whose sum is divisible by 5. **The length of subsequence >=2. ###Input: First line contains an integer N. Second line contains N integers. ###Output: Output an integer denoting total number of subsequence whose sum is divisible by 5. ###Sample Input: 5 4 6 8 9 5 ###Sample Output: 1 ###EXPLANATION: There are 2 subsequence whose

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