Pagini recente » Cod sursa (job #1880044) | Cod sursa (job #471830) | Cod sursa (job #2080286) | Cod sursa (job #1682553) | Cod sursa (job #1104289)
#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 sol(void)
{
int i,j,y;
int nr=0;
f>>n>>k>>a>>b;
for(i=1;i<b;i++)
{
f>>v[i];
v[i]=v[i]+v[i-1];
}
for(int i=b;i<=n;i++)
{
f>>v[i];
v[i]=v[i]+v[i-1];
for(j=b;j>=a;j--)
{
y=v[i]-v[i-j];
if(y%k==0)
nr++;
}
}
g<<nr;
}
int main()
{
sol();
return 0;
}