Cod sursa(job #1304117)
Utilizator | Data | 28 decembrie 2014 17:37:30 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int a[500001],n,k,b,i,j,t,s,c;
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%d%d%d%d",&n,&k,&c,&b);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n-c+1;i++)
{
s=0;
for(j=i;(j<=i+b)&&(j<=n);j++)
{
s=s+a[j];
if((s%k==0)&&(j-i+1>=c))
t++;
}
}
printf("%d",t);
return 0;
}