Pagini recente » Cod sursa (job #3217403) | Cod sursa (job #562959) | Cod sursa (job #2884487) | Cod sursa (job #407162) | Cod sursa (job #1342401)
#include <fstream>
#define nmax 500005
#define kmax 100005
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
long long sol;
int n,k,a,b;
int v[nmax];
int p[kmax];
int main()
{
int i,j,x;
f>>n>>k>>a>>b;
for (i=1;i<=n;i++){
f>>x;
v[i]=(v[i-1]+x)%k;
}
for (i=a+1;i<=n;i++) {
p[v[i-a]]++;
if (i-b>=1)
p[v[i-b]]--;
sol+=1LL*p[v[i]];
}
for (i=a;i<=b;i++)
if (v[i]==0)
sol++;
g<<sol;
return 0;
}