Pagini recente » Cod sursa (job #691743) | Cod sursa (job #71700) | Cod sursa (job #554558) | Cod sursa (job #2368158) | Cod sursa (job #587741)
Cod sursa(job #587741)
#include<fstream>
#include<iostream>
using namespace std;
int main()
{int n,k,a,b,s[100000],i,q,j,x;
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
q=0;
s[0]=0;
for(i=1;i<=n;i++)
{f>>x;
s[i]=x+s[i-1];}
for(i=0;i<=n-1;++i)
{for(j=i+a;j<=i+b&&j<=n;++j)
if((s[j]-s[i])%k==0)
++q; }
g<<q<<'\n';
f.close();
g.close();
return 0;
}