Pagini recente » Cod sursa (job #3122673) | Cod sursa (job #3003127) | Cod sursa (job #2203355) | Cod sursa (job #931200) | Cod sursa (job #1103903)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
long long v[500001];
int n,k,a,b;
void citire(void)
{
f>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
f>>v[i];
v[i]=v[i]+v[i-1];
}
}
void solutie(void)
{
int i,j,nr=0,y;
for(i=n;i>=b;i--)
{
for(j=i-a;j>=i-b;j--)
{
y=v[i]-v[j];
//if(v[i]-v[j]%k==0)
// nr++;
if(y%k==0)
nr++;
}
}
g<<nr;
}
int main()
{
citire();
solutie();
return 0;
}