Easy10 pts
Subarray Division
n squares of chocolate, each with d. Find contiguous segments of length m that sum to d. Count ways.
Input
n\narr\nm d
Output
Count.
Sample
5 1 2 1 3 2 3 2
Expected
2
Loading editor…
Output
No output yet. Run your code to see results.