#include <bits/stdc++.h>
using namespace std;
int subArraySumLessEqualToK(vector<int> &arr, int k){
int n = arr.size();
int count = 0;
for (int i = 0; i < n; i++){
int sum = 0;
for (int j = i; j < n; j++){
sum += arr[j];
if(sum <= k) count++;
}
}
return count;
}
int main() {
// your code goes here
vector<int> arr = {2, 1, 1, 5, 8};
cout << subArraySumLessEqualToK(arr, 4);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgc3ViQXJyYXlTdW1MZXNzRXF1YWxUb0sodmVjdG9yPGludD4gJmFyciwgaW50IGspewoJaW50IG4gPSBhcnIuc2l6ZSgpOwoJaW50IGNvdW50ID0gMDsKCQoJZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspewoJCWludCBzdW0gPSAwOwoJCWZvciAoaW50IGogPSBpOyBqIDwgbjsgaisrKXsKCQkJc3VtICs9IGFycltqXTsKCQkJaWYoc3VtIDw9IGspIGNvdW50Kys7CgkJfQoJfQoJCglyZXR1cm4gY291bnQ7Cn0KCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJdmVjdG9yPGludD4gYXJyID0gezIsIDEsIDEsIDUsIDh9OwoJY291dCA8PCBzdWJBcnJheVN1bUxlc3NFcXVhbFRvSyhhcnIsIDQpOwoJcmV0dXJuIDA7Cn0=