Cod sursa(job #1184582)
Utilizator | Data | 13 mai 2014 12:00:55 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
#include <iostream>
using namespace std;
const int N=5e6+1;
int x,i,j,k,A,B,n;
long long a[N],sum,sol,r[N];
int main()
{
ifstream d("divk.in");
ofstream o("divk.out");
d>>n>>k>>A>>B;
for(i=1;i<=n;i++)
{
d>>x;
a[i]=(a[i-1]+x)%k;
}
for(i=1;i<=n;i++)
{
if(i>=A)
r[a[i-A]]++;
if(i>B)
r[a[i-B-1]]--;
sol+=r[a[i]];
}
o<<sol;
return 0;
}