Cod sursa(job #565558)
| Utilizator | Data | 27 martie 2011 21:53:12 | |
|---|---|---|---|
| Problema | Divk | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<stdio.h>
#define N 500001
long c,n,k,a,b,i,j;
long long s[N],l=0;
int main()
{freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%ld%ld%ld%ld\n",&n,&k,&a,&b);
s[0]=0;
for(i=1;i<=n;i++)
{scanf("%ld\n",&c);
s[i]=s[i-1]+c;}
for(j=a;j<=b;j++)
{for(i=0;i<=n-j;i++)
if((s[i+j]-s[i])%k==0)
l++;}
printf("%lld\n",l);
fclose(stdin);
fclose(stdout);
return 0;}
