Pagini recente » Arhiva de probleme | Solutii Summer Challenge, Runda 2 | Cod sursa (job #259740) | Cod sursa (job #1900342) | Cod sursa (job #306545)
Cod sursa(job #306545)
#include<stdio.h>
unsigned long long int v[500010],i,j,k,l,m,a,b,n,p,q,r[100010],sol;
int main(){
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%lld %lld %lld %lld",&n,&k,&a,&b);
for(i=1;i<=a&&i<=n;i++)
{scanf("%lld",&v[i]);
v[i]=(v[i]+v[i-1])%k;
}
p=0;
for(i=a;i<=b&&i<=n;i++)
{scanf("%lld",&v[i]);
v[i]=(v[i]+v[i-1])%k;
r[v[p]]++;p++;
sol+=r[v[i]];
}
q=1;
for(i=b+1;i<=n;i++)
{scanf("%lld",&v[i]);
v[i]=(v[i]+v[i-1])%k;
r[v[p]]++;p++;
r[v[q]]--;q++;
sol+=r[v[i]];}
printf("%lld",sol);
return 0;}