Chef & Divisible Sum

CodeChefOpen on judge ↗

Given an integer array nums and an integer $K$, output the number of non-empty subarrays that have a sum divisible by $K$. A subarray is a contiguous part of an array. ### Input - First-line will contain $T$, the number of test cases. Then the test cases follow. - The first line of each test case $N$ and $K$ - The Second line contains $N$ integers $Ai$ ### Output For each test case, output in a

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