Cod sursa(job #1184580)
Utilizator | Data | 13 mai 2014 11:57:53 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <cstdio>
using namespace std;
long long x,i,j,k,A,B,a[500010],n,sum,sol,r[500010];
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;
}