这个题解不正经,可以不用看了...
打表找规律生生找出来2333333,的并不知道正解是怎么YY出来的╮(~▽~)╭
推荐正经题解:http://blog.csdn.net/aarongzk/article/details/44871391
var
f :array[0..2,0..4210] of longint;
n,p,x,y :longint;
ans :int64;
i,j :longint;
begin
read(n,p);
f[0,1]:=1; y:=1; x:=0;
for i:=2 to n do
begin
for j:=1 to i do
f[y,j]:=(f[y,j-1]+f[x,i-j+1]) mod p;
x:=x xor 1; y:=y xor 1;
end;
for i:=1 to n do ans:=(ans+f[x,i]) mod p;
writeln((2*ans) mod p);
end.
——by Eirlys