Cod sursa(job #155409)
Utilizator | Data | 11 martie 2008 21:53:21 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream.h>
int x[100000],s,nr,i,j,k,l,m,n,a,b,c;
int main(){
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{f>>m;
s+=m;
s%=k;
if(s==0)
if(i>=a&&i<=b)
nr++;
if(x[s]!=0)
{j=i-x[s]+1;
if(j>=a&&j<=b)
nr++;
}
x[s]=i;
}
g<<nr;
f.close();
g.close();
return 0;
}