Pagini recente » Cod sursa (job #1903353) | Cod sursa (job #1203598) | Cod sursa (job #1758881) | Cod sursa (job #2796636) | Cod sursa (job #1103934)
#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)
{
int nr=0;
int i,j,y;
f>>n>>k>>a>>b;
for(int i=1;i<k;i++)
{
f>>v[i];
v[i]=v[i]+v[i-1];
}
for(int i=k;i<=n+1;i++)
{
f>>v[i];
v[i]=v[i]+v[i-1];
for(j=i-b;j<=i-a;j++)
{
y=v[i-1]-v[j-1];
if(y%k==0)
{
nr++;
//for(int k=j;k<i;k++)
// cout<<v[k]-v[k-1]<<" ";
// cout<<"\n";
}
}
}
g<<nr;
}
/*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;
}