Pagini recente » Cod sursa (job #259486) | Cod sursa (job #2731934) | Cod sursa (job #2604088) | Cod sursa (job #1239292) | Cod sursa (job #1127108)
#include<fstream>
#define NMAX 500005
#define KMAX 100005
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int n,k,a,b,A[KMAX],B[KMAX],v[NMAX];
long long sol;
int main()
{
fin>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
fin>>v[i];
v[i]=(v[i]+v[i-1])%k;
}
A[0]=B[0]=1;
if(!v[a])
{
sol=1;
A[0]++;
}
for(int i=a+1;i<=n;i++)
{
A[v[i-a]]++;
sol+=A[v[i]];
if(i>b+1)
{
B[v[i-b-1]]++;
sol-=B[v[i]];
}
}
fout<<sol;
return 0;
}