Pagini recente » Cod sursa (job #1496788) | Cod sursa (job #2108392) | Cod sursa (job #2978248) | Cod sursa (job #2818077) | Cod sursa (job #2253587)
#include <bits/stdc++.h>
#define NUM 100005
int v[NUM];
int s[NUM * 5];
int n, k, a, b;
long long rez;
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int main()
{
f >> n >> k >> a >> b;
for(int i = 1, x; i <= n; i++)
{
f >> x;
s[i] = (x + s[i - 1]) % k;
}
for(int i = 1; i <= n; i++)
{
if(i >= a)
v[s[i - a]]++;
if(i >= b + 1)
v[s[i - (b + 1)]]--;
rez += v[s[i]];
}
g << rez;
return 0;
}