Cod sursa(job #649171)
| Utilizator | Data | 15 decembrie 2011 16:00:30 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<cstdio>
#define N 500001
int n,k,a,b,i,c,v[N/5];
long long s[N],t;
int main()
{FILE *f=fopen("divk.in","r"),*g=fopen("divk.out","w");
fscanf(f,"%d%d%d%d",&n,&k,&a,&b);
for(i=1;i<=n;i++)
{fscanf(f,"%d",&c),s[i]=s[i-1]+c;
if(i>b&&v[s[i-b-1]%k]>0)
v[s[i-b-1]%k]--;
if(i>=a)
v[s[i-a]%k]++;
t+=v[s[i]%k];}
fprintf(g,"%lld",t);
return 0;}
