Pagini recente » Cod sursa (job #2661566) | Cod sursa (job #1413253) | Cod sursa (job #334793) | Istoria paginii runda/left-oji | Cod sursa (job #483595)
Cod sursa(job #483595)
#include<stdio.h>
using namespace std;
#define dim 500005
long long v[dim],s;
int n,K,A,B,nr,i,j;
int main()
{
FILE *f=fopen("divk.in","r"), *g=fopen("divk.out","w");
fscanf(f,"%d %d %d %d",&n,&K,&A,&B);
for(i=1;i<=n;i++)
fscanf(f,"%lld ",&v[i]);
for(i=1;i<=n-1;i++)
{
s=v[i];
for(j=i+1; j<=n&&j-i+1<=B; j++)
{
if(j-i+1>=A)
{
s+=v[j];
if(s%K==0)
nr++;
}
else s+=v[j];
}
}
fprintf(g,"%d\n",nr);
fclose(f);
fclose(g);
return 0;
}