Pagini recente » Cod sursa (job #678034) | Cod sursa (job #2721389) | Cod sursa (job #2649374) | Cod sursa (job #1279345) | Cod sursa (job #587737)
Cod sursa(job #587737)
#include<fstream>
#include<iostream>
using namespace std;
int main()
{int n,k,a,b,s[100000],v[100000],i,q,j;
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>>v[i];
s[i]=v[i]+s[i-1];}
for(i=0;i<=n-1;++i)
{for(j=i+a;j<=i+b;++j)
if(((s[j]-s[i])%k==0)&&(j<=n))
++q; }
g<<q<<'\n';
f.close();
g.close();
return 0;
}