7530: [CSES Problem Set] Subarray Sums I
[Creator : ]
Description
Given an array of $n$ positive integers, your task is to count the number of subarrays having sum $x$.
Input
The first input line has two integers $n$ and $x$: the size of the array and the target sum $x$.
The next line has $n$ integers $a_1,a_2,\dots,a_n$: the contents of the array.
The next line has $n$ integers $a_1,a_2,\dots,a_n$: the contents of the array.
Output
Print one integer: the required number of subarrays.
Constraints
$1≤n≤2⋅10^5$
$1 \le x,a_i \le 10^9$
$1 \le x,a_i \le 10^9$
Sample 1 Input
5 7
2 4 1 2 7
Sample 1 Output
3