cjoilmd 2011-10-05 17:02:00
点我顶贴
收藏
删除
program rq73;
var
f:array[0..200,0..200]of longint;
ans,i,j,k,p,n:longint;
procedure dp;
begin
f[0,0]:=1;
for i:=1 to n do
for j:=1 to i do
begin
p:=i-j;
for k:=0 to p do
if k<j then
f[i,j]:=f[i,j]+f[p,k];
end;
ans:=0;
for i:=1 to n do
ans:=ans+f[n,i];
writeln(ans-1);
end;
begin
inf;
read(n);
dp;
ouf;
end.
ans-1才能过,原来是一排的时候不算方案...............