6721.Subarray Sums II

Time Limit: 1s Memory Limit: 512MB

Given an array of $n$ integers, your task is to count the number of subarrays having sum $x$ .

Input Format(From the terminal/stdin)

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.

  • $1 \le n \le 2 \cdot 10^5$
  • $-10^9 \le x,a_i \le 10^9$

Output Format(To the terminal/stdout)

Print one integer: the required number of subarrays.

Sample Input

Copy
5 7
2 -1 3 5 -2
 · \n
 ·  · · ·  \n

Sample Output

Copy
2
 \n
Source: CSES, Sorting and Searching, 1661

Submit

请先 登录

© 2025 FAQs