Cod sursa(job #668720)
| Utilizator | Data | 25 ianuarie 2012 15:46:20 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
int sum[500001],v[500001];
ifstream in("divk.in");
ofstream out("divk.out");
int main()
{
int n,x,i,k,a,b;
long long rez=0;
in>>n>>k>>a>>b;
sum[0]=0;
for(i=1;i<=n;i++)
{
in>>x;
sum[i]=(sum[i-1]+x)%k;
if(i>=a)
v[sum[i-a]]++;
if(i>b)
v[sum[i-b-1]]--;
rez+=v[sum[i]];
}
out<<rez<<'\n';
return 0;
}
