Cod sursa(job #153226)
Utilizator | Data | 10 martie 2008 12:09:26 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream.h>
long a,b,n,x,v[500000],i,j,s,p=0,k;
int main()
{
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{f>>v[i];}//x;v[i]=x%k;}
for(i=1;i<=(n-a+1);i++)
{s=0;
for(j=i;j<=i+k,j<=n;j++)
{s+=v[j];
if(s%k==0&&(j-i+1)>=a&&(j-i+1)<=b) p++;
}
}
g<<p;
f.close();
g.close();
return 0;
}