Cod sursa(job #150066)
| Utilizator | Data | 6 martie 2008 15:48:45 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<fstream.h>
int x[5000001][500001],i,j,k,l,m,a,b,n,d,nr,h;
int main(){
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{f>>m;
m%=k;
x[i][i]=x[0][i]=m;
}
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{m=x[i][j-1];
m+=x[0][j];
m%=k;
x[i][j]=m;
l=j-i+1;
if((l>=a)&&(l<=b)&&(m==0))
nr++;
}
g<<nr;
f.close();
g.close();
return 0;
}