Pagini recente » Istoria paginii runda/onis-2014-runda-2/clasament | Cod sursa (job #1089202) | Cod sursa (job #370538) | Cod sursa (job #1097727) | Cod sursa (job #807872)
Cod sursa(job #807872)
#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 500005
int N, K, A, B, X[NMAX];
long long sum[NMAX];
void precompute()
{
sum[0] = 0;
sum[1] = X[1];
for(int i = 1; i <= N; ++i)
sum[i] = sum[i-1] + X[i];
}
long long solve()
{
long long nr = 0;
for(int i = 1; i <= N - A + 1; ++i)
{
for(int j = i + A - 1; (j <= i + B - 1) && (j <= N); ++j)
{
long long s = sum[j] - sum[i-1];
if(s % K == 0)
{
//cout << i << " " << j << endl;
++nr;
}
}
}
return nr;
}
int main()
{
ifstream in("divk.in");
ofstream out("divk.out");
in >> N >> K >> A >> B;
for(int i = 1; i <= N; ++i)
in >> X[i];
precompute();
out << solve();
return 0;
}