Pagini recente » Cod sursa (job #995247) | Cod sursa (job #2043919) | Cod sursa (job #2839757) | Cod sursa (job #1916864) | Cod sursa (job #3202676)
#include <fstream>
using namespace std;
int vec[500001];
int n, k, a, b, dr = 1, st = 1, divk;
int main()
{
ifstream cin("divk.in");
ofstream cout("divk.out");
cin >> n >> k >> a >> b;
for(int i = 1; i <= n; i ++){
cin >> vec[i];
}
for(int i = 1; i <= n; i ++){
vec[i] += vec[i - 1];
vec[i] %= k;
}
while(st <= n)
{
if(vec[dr] == vec[st - 1] and (dr - st + 1 >= a and dr - st + 1 <= b)){
divk ++;
//cout << st << ' ' << dr << ' ' << (dr - st + 1) << '\n';
}
dr ++;
if(dr > n){
st ++;
dr = st;
}
}
cout << divk;
return 0;
}