Pagini recente » Cod sursa (job #3267342) | Cod sursa (job #21324) | Cod sursa (job #2229050) | Cod sursa (job #888604) | Cod sursa (job #1098998)
#include<fstream>
using namespace std;
ifstream cin ("divk.in");
ofstream cout ("divk.out");
int n,k,a,b;
long long solutie , v[30001],sol[30001],nr[30001];
int main ()
{
int i;
cin>>n>>k>>a>>b;
for (i=1;i<=n;i++)
{
cin>>v[i];
sol[i]=(sol[i-1]+v[i])%k;
if(i>b)
--nr[sol[i-b-1]];
if (i>=a)
++nr[sol[i-a]];
solutie+=nr[sol[i]];
}
cout<<solutie;
cin.close();
cout.close();
return 0;
}