Cod sursa(job #280829)
Utilizator | Data | 13 martie 2009 16:31:25 | |
---|---|---|---|
Problema | Divk | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream.h>
ifstream f("divk.in");
ofstream g("divk.out");
long long v[500000],nr,n,a,b,k,x,i,j;
int main(){
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{f>>x;
v[i]=v[i-1]+x;}
for(i=1;i<=n-a+1;i++)
for(j=i+a-1;j<=i+b-1&&j<=n;j++)
if((v[j]-v[i-1])%k==0)
nr++;
g<<nr;
return 0;
}