Cod sursa(job #187664)
| Utilizator | Data | 5 mai 2008 00:05:41 | |
|---|---|---|---|
| Problema | Divk | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
# include <stdio.h>
long int c[100000],i,j,n,q,k,a,b,s;
int main ()
{
freopen ("divk.in","r",stdin);
freopen ("divk.out","w",stdout);
scanf ("%li",&n);
scanf ("%li",&k);
scanf ("%li",&a);
scanf ("%li",&b);
for (i=0;i<n;i++)
scanf ("%li",&c[i]);
for (i=0;i<n-1;i++)
{
s=c[i];
for (j=i+1;j<n;j++)
{
s=s+c[j];
if (j-i+1>=a && j-i+1<=b)
if (s%k==0)
q++;
}
}
printf ("%li",q);
return 0;
}
