Cod sursa(job #478071)
Utilizator | Data | 17 august 2010 12:47:32 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int n,k,a,b,s[500001],v[500001],x;
long long rez;
int main()
{
int i;
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
f>>x;
s[i]=(s[i-1]+x)%k;
}
for(i=a;i<=n;i++)
{
v[s[i-a]]++;
if(i-b-1>=0)
v[s[i-b-1]]--;
rez+=v[s[i]];
}
g<<rez;
return 0;
}