Birthday Chocolate

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <bits/stdc++.h>
 
using namespace std;
 
int solve(int n, vector < int > s, int d, int m){
    // Complete this function
    int sol = 0;
    for(int i = 0; i < n-m+1; i ++) {
 
        int dist = i + m;
        int cand = 0 ;
        for(int j = i; j <dist; j++) {
            cand = cand + s[j];
        }
 
        if (cand == d) {
            sol++;
        }
    }
    return sol;
}
 
int main() {
    int n;
    cin >> n;
    vector<int> s(n);
    for(int s_i = 0; s_i < n; s_i++){
       cin >> s[s_i];
    }
    int d;
    int m;
    cin >> d >> m;
    int result = solve(n, s, d, m);
    cout << result << endl;
    return 0;
}