Pagini recente » Cod sursa (job #240305) | Cod sursa (job #2363292) | Cod sursa (job #1043637) | Cod sursa (job #2713959) | Cod sursa (job #901479)
Cod sursa(job #901479)
#include <iostream>
#include <fstream>
using namespace std;
long long n, k, a, b, sol, v[500010], app[100010];
int main()
{
freopen("divk.in", "r", stdin);
freopen("divk.out", "w", stdout);
long long i, elem;
cin >> n >> k >> a >> b;
for(i = 1; i <= n; i++)
{
cin >> elem;
v[i] = (v[i - 1] + elem) % k;
}
for(i = 1; i <= n; i++)
{
if( i - a >= 0 )
app[v[i - a]]++;
if( i - b > 0 )
app[v[i - b - 1]]--;
sol += app[v[i]];
}
cout << sol;
return 0;
}