Pagini recente » Cod sursa (job #1971308) | Cod sursa (job #557999) | Cod sursa (job #983179) | Cod sursa (job #2424587) | Cod sursa (job #590311)
Cod sursa(job #590311)
#include <fstream>
using namespace std;
long long v[600001];
long n, k, a, b, t, i, j;
unsigned long long s;
int main()
{
ifstream f ("divk.in");
ofstream g ("divk.out");
f>>n;
f>>k;
f>>a;
f>>b;
t=0;
for (i=1; i<=n; i++) f>>v[i];
for (i=1; i<=n-a; i++)
{
s=0;
for (j=1; j<=a; j++) s+=v[j+i-1];
for (j=1; j<=b-a+1; j++)
{
if (s%k==0) t++;
s+=v[a+i-2+j];
}
}
g<<t;
return 0;
}