Pagini recente » Cod sursa (job #1549560) | Cod sursa (job #3186566) | Cod sursa (job #3194933) | Cod sursa (job #936009) | Cod sursa (job #1513599)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
int main()
{
ifstream f("divk.in");
long n, k, a, b;
long nr_solutii = 0;
f >> n >> k >> a >> b;
vector<long>nr;
nr.push_back(0);
for (long i = 1; i <= n; i++)
{
long nre;
f >> nre;
nr.push_back(nre);
}
for (long w = a; w <= b; w++)
for (long i = 0; i <= n - w; i++)
{
unsigned long long s = 0;
for (long j = i + 1; j <= i + w; j++)
s += nr[j];
if (s % k == 0 && s > 0)
nr_solutii++;
}
ofstream f1("divk.out");
f1 << nr_solutii << "\n";
return 0;
}