Cod sursa(job #26925)
Utilizator | Data | 5 martie 2007 22:42:12 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
const p=194767;
var f:text;
n,i,j:integer;
s:int64;
a1,a2:array[0..32896] of int64;
begin
assign(f,'1-sir.in');
reset(f);
readln(f,n,s);
close(f);
a1[0]:=1;
for i:=2 to n do
begin
for j:=0 to i*(i-1) div 2 do
a2[j]:=(a1[abs(j+i-1)]+a1[abs(j-i+1)]) mod p;
a1:=a2;
end;
assign(f,'1-sir.out');
rewrite(f);
writeln(f,a1[abs(s)]);
close(f);
end.