Pagini recente » Cod sursa (job #2536131) | Cod sursa (job #66034) | Cod sursa (job #538693) | Cod sursa (job #1144512) | Cod sursa (job #155407)
Cod sursa(job #155407)
#include<fstream.h>
int x[5000],ok[10000],i,j,k,nr,n,a,b,m,s;
int main(){
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{f>>m;
m%=k;
s+=m;
s%=k;
if(s==0)
if((i>=a)&&(i<=b))
nr++;
ok[s]++;
x[i]=s;
}
for(i=1;i<=n-a ;i++)
{if(ok[x[i]]>=2)
for(j=i+a;((j<=i+b-1)&&(j<=n));j++)
if(x[i]==x[j])
nr++;
}
g<<nr;
f.close();
g.close();
return 0;
}