백준 소스코드 [C++] 2003 수들의 합 2

www.acmicpc.net/problem/2003

2003번: 수들의 합 2

백준 소스코드 [C++] 2003 수들의 합 2

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#include <set>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
#define make_unique(v) v.erase(unique(v.begin(), v.end()), v.end())
typedef long long ll;
using namespace std;

int n, m;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m;
	vector<int> v;
	v.resize(n);
	for (int i = 0;i < n;i++) cin >> v[i];

	int l = 0, r = 0, sum = 0,cnt=0;

	while (true) {
		
		 if (sum >= m)  sum -= v[l++];
		 else if (r == n) break;
		 else sum += v[r++];

		if (sum == m) cnt++;
	}
	cout << cnt;
	return 0;
}