Pagini recente » Cod sursa (job #2440159) | Cod sursa (job #2573031) | Cod sursa (job #1769311) | Cod sursa (job #1329585) | Cod sursa (job #975628)
Cod sursa(job #975628)
#include <fstream>
#define In "divk.in"
#define Out "divk.out"
#define Kmax 100004
#define Nmax 500004
using namespace std;
int sum[Nmax], f[Kmax], n, l , r, MOD;
long long sol;
int main()
{
int i, x;
ifstream in(In);
ofstream out(Out);
in>> n >> MOD >> l >> r;
for(i = 1;i <= n; ++i)
{
in>>x;
sum[i] = (sum[i-1]+x)%MOD;
if(i>r)
--f[sum[i-r-1]];
if(i>=l)
++f[sum[i-l]];
sol += f[sum[i]];
}
out<<sol<<"\n";
out.close();
return 0;
}