Pagini recente » Cod sursa (job #543472) | Cod sursa (job #2582025) | Cod sursa (job #958257) | Cod sursa (job #1778634) | Cod sursa (job #1631398)
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int n,c1,c2,poz,v[500005],s,k,i,l,submultimibune,m,kappa;
int main()
{
f>>n>>k>>c1>>c2;poz=1;kappa=n-c1+1;
for(i=1;i<=n;i++)f>>v[i];
while(poz<=kappa)
{ s=0;
for(i=poz;i<c1;i++)s=s+v[i];
for(l=c1;l<=c2;l++){s=s+v[l];
if(s%k==0)submultimibune++;}
poz++;c1++;if(c2<n)c2++;
}
g<<submultimibune<<'\n';
f.close();
g.close();
return 0;
}