Cod sursa(job #917187)
| Utilizator | Data | 17 martie 2013 14:06:47 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int v[500001],nr,i,j,a,b,n,k;
long long s;
int main()
{ f>>n>>k>>a>>b;
for(i=1;i<=n;++i) f>>v[i];
for(i=1;i<=n;++i)
{ for(j=i;j<i+a;++j)
s+=v[j];
if(s%k==0) nr++;
for(j=i+a;j<i+b&&j<=n;++j)
{ s+=v[j];
if(s%k==0) nr++;
}
s=0;
}
g<<nr<<'\n';
f.close();
g.close();
return 0;
}
