Subarrays of a given sum
Given an array of numbers, you would like to know how many subarrays are there that sum up to exactly
s.Input
The first line of the input contains two integers -
n the number of elements in the array (1 ≤ n ≤ 1000) and the number s . The next line contains n integers separated by a space, that represent the elements of the array . Output
The program should print a single integer - the number of subarrays with sum
s. In case there are no subarrays that sum up to s, the program should print 0.Examples
Input | Output |
6 33
9 4 20 3 10 5 | 2 |
5 -10
10 2 -2 -20 10 | 3 |
Explanation
9 4 203 10 5,9 420 3 105
10 2 -2 -2010,102 -2 -20 10,10 2 -2-20 10
Constraints
Time limit: 2.4 seconds
Memory limit: 512 MB
Output limit: 1 MB