Cod sursa(job #152515)
Utilizator | Data | 9 martie 2008 15:16:46 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream.h>
int x[10001],a,b,i,j,nr,s,k,l,m,n,o,p;
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(x[s]==0)
x[s]=i;
else
if(((i-x[s]+1)>=a)&&((i-x[s]+1)<=b))
nr++;
if(s==0)
if(i<=b&&i>=a)
nr++;
}
g<<nr;
f.close();
g.close();
return 0;
}