Cod sursa(job #49999)
Utilizator | Voroneanu Radu Stefan radu_voroneanu | Data | 6 aprilie 2007 18:30:29 |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
var t,s,v:array[0..100000] of int64;
f,g:text;
n,k,a,b,i,tot:longint;
begin
assign(f,'divk.in'); reset(f);
assign(g,'divk.out'); rewrite(g);
read(f,n,k,a,b);
tot:=0;
for i:=1 to n do begin
read(f,t[i]);
s[i]:=s[i-1]+t[i];
if i>=b then
dec(v[s[i-b] mod k]);
if i+1>=a then
inc(v[s[i-a+1] mod k]);
tot:=tot+v[s[i] mod k];
end;
writeln(g,tot);
close(f); close(g);
end.