Cod sursa(job #166731)
| Utilizator | Data | 28 martie 2008 14:02:37 | |
|---|---|---|---|
| Problema | Divk | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream.h>
long a,b,n,x,i,j,s,p=0,k;
int v[500001];
int main()
{
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{f>>x; v[i]=x%k;}
for(i=1;i<=n-a+1;i++)
{ s=0;
for(j=i;j<=(i+a-1);j++)
s+=v[j];
if(s%k==0) p++;
while (j<=(i+b-1)&&j<=n)
{
s+=v[j];
if(s%k==0) p++;
j++;
}
}
g<<p;
f.close();
g.close();
return 0;
}