Pagini recente » Cod sursa (job #1351699) | Cod sursa (job #3124484) | wellcodesimulare2martieclasa11-12 | Cod sursa (job #1640575) | Cod sursa (job #2053128)
#include <fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
int ap[100005],n,k,a,b,v[500005],s;
int main()
{
cin>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
cin>>v[i];
v[i]=(v[i-1]+v[i])%k;
}
for(int i=1;i<=a;i++)
ap[v[i]]++;
for(int i=a+1;i<=n;i++)
{
if(i>b)
ap[v[i-b]]--;
s+=ap[v[i]];
ap[v[i]]++;
}
cout<<s;
return 0;
}