Function main

CSES_Problems/Subarray Sum - II/solution.cpp:18–38

*/

signed main() {
        int n, x;
        cin >> n >> x;
        int a[n];
        for(int i = 0; i < n; i++)
                cin >> a[i];
        map<int, int> m; // map will keep track for the sum from the first index to 
        m[0] = 1;
        int ans = 0;
        int curr = 0;
        for(int i = 0; i < n; i++) {
                curr += a[i];
                int req = curr - x;
                if(m.count(req)) {
                        ans += m[req];
                }
                m[curr]++;
        }
        cout << ans <<"\n";
        return 0;
}