Cod sursa(job #12613)
Utilizator | Data | 4 februarie 2007 15:00:00 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
const modd=194767;
var fi,fo:text;
n,s,i,j:longint;
nr,nrn:array[0..50000]of longint;
begin
assign(fi,'1-sir.in'); reset(fi);
assign(fo,'1-sir.out'); rewrite(fo);
readln(fi,n,s);
nr[0]:=1;
for i:=2 to n do
begin
for j:=0 to i*(i-1)div 2 do
nrn[j]:=(nr[abs(j-i+1)]+nr[abs(j+i-1)])mod modd;
nr:=nrn;
end;
s:=abs(s);
if s<=n*(n-1)div 2 then
writeln(fo,nr[s])
else writeln(fo,0);
close(fo);
end.