Read two integers n and k, then n integers forming a sequence v[1], v[2], ..., v[n]. Count how many contiguous subarrays v[i], v[i+1], ..., v[j] have a sum equal to k.
Mobile coding works. A laptop is faster for long sessions.
Problem
Input format
Input
input.txt
The first line contains two integers `n` and `k` separated by a space. The second line contains `n` integers separated by spaces. - `1 <= n <= 1000` - `-10^6 <= k <= 10^6` - `-1000 <= v[i] <= 1000` - each subarray must contain at least one element
Output format
Output
output.txt
Print a single natural number: the count of contiguous subarrays whose sum equals `k`, followed by a newline.
Example
input
5 7 1 2 3 4 5
output
1
Stuck?
Use the Get Hint button in the action bar to reveal a guided hint.
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
5 7 1 2 3 4 5
Expected output
1
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc