Pagini recente » Cod sursa (job #2192109) | Cod sursa (job #2701535) | Cod sursa (job #1014958) | Cod sursa (job #329708) | Cod sursa (job #1332725)
#include<cstdio>
#include<vector>
using namespace std;
int spart=0;
vector<int> v[100000];
int main()
{
FILE *in=fopen("divk.in", "r"),
*out=fopen("divk.out", "w");
int n, k, a, b, tmp, rasp=0, j, i, q;
fscanf(in, "%d%d%d%d", &n, &k, &a, &b);
for(i=0; i<=n; i++)
{
fscanf(in, "%d", &tmp);
v[spart].push_back(i);
spart=(spart+tmp)%k;
}
for(i=0; i<k; i++)
{
j=0; q=1;
while(q<v[i].size())
{
if(v[i][q]-v[i][j]>=a && v[i][q]-v[i][j]<=b)
rasp++;
if(!v[i][q]-v[i][j]<a && j<q-1)
j++;
else
q++;
}
}
fprintf(out, "%d", rasp);
fclose(in);
fclose(out);
return 0;
}