Subarray Sums I#11721
Given an array of positive integers, find the number of subarrays whose sum is equal to .
The first line contains the size of the array n~(1 \le n \le 2 \cdot 10^5) and the target sum x~(1 \le x \le 10^9). The next line contains integers a_1, a_2, \ldots, a_n~(1 \le a_i \le 10^9) — the contents of the array.
Print the required number of subarrays.
Example 1