Pagini recente » Cod sursa (job #426153) | Cod sursa (job #2228596) | Cod sursa (job #1460132) | Cod sursa (job #2687981) | Cod sursa (job #29097)
Cod sursa(job #29097)
#include <stdio.h>
#include <math.h>
unsigned long long s[500000],n,a,b,k,cate;
void citeste(){long nr;
FILE *f=fopen("divk.in","rt");
fscanf(f,"%lld %lld %lld %lld",&n,&k,&a,&b);s[0]=0;
for(int i=1;i<=n;i++){
fscanf(f,"%ld",&nr);
s[i]=s[i-1]+nr;
}
fclose(f);
}
void rezolva(){
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(s[i]%k==s[j]%k) {
if((abs(i-j)<=b) && (abs(i-j)>=a)) cate++;
}
}
}
}
inline void scrie(){
FILE *g=fopen("divk.out","wt");
fprintf(g,"%lld",cate);
fclose(g);
}
int main(){
citeste();
rezolva();
scrie();
return 0;
}