Cod sursa(job #280725)
Utilizator | Data | 13 martie 2009 15:39:18 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 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;
if(i<=n-a+1){
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;
}