Cod sursa(job #660914)
| Utilizator | Data | 13 ianuarie 2012 14:38:29 | |
|---|---|---|---|
| Problema | Divk | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
#include<iostream>
using namespace std;
int v[500001];
long long s[500001],c;
int main ()
{
int v[500001],k,n,a,b,i,j;
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
for(i=1;i<=n;i++)
s[i]=s[i-1]+v[i];
j=1;
for(i=a;j<=n-a+1;i++) {
if((i-j+1)>b) {
j++;
i=j+a-1;
}
if((i<=n)&&((s[i]-s[j-1])%k==0))
c++;
}
g<<c;
g.close();
return 0;
}