We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
int count = 0;
for (int i = 0; i < s.size() - m + 1; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
sum = sum + s[i + j];
}
if (sum == d) {
count++;
}
}
return count;
Birthday Chocolate
You are viewing a single comment's thread. Return to all comments →
In C++
int count = 0; for (int i = 0; i < s.size() - m + 1; i++) { int sum = 0; for (int j = 0; j < m; j++) { sum = sum + s[i + j]; } if (sum == d) { count++; } } return count;