讨论 / 很短吧
timetobehardworking 2011-08-15 22:24:00
点我顶贴 收藏 删除
var

f:array [0..100] of longint;

i,j,k,n:longint;

begin

read(n);

f[1]:=1;

for k:=2 to n+1 do

for i:=1 to k-1 do

f[k]:=f[k]+f[i]*f[k-i];

write(f[n+1]);

end.

呵呵 11 行。

#1 小小小学生@2009-05-09 22:54:00
回复 删除
去年编的

program ping;

var n,m,i,j,k,t:longint;

a:array[-5..100,-5..100] of longint;

begin

read(n);

for i:=1 to n do a[i,0]:=1;for j:=1 to n do

for i:=0 to n do

a[i,j]:=a[i-1,j]+a[i+1,j-1];

write(a[0,n]);

end.

#2 timetobehardworking@2009-05-10 21:49:00
回复 删除
program ping;

var

n,m,i,j,k,t:longint;

a:array[-5..100,-5..100] of longint;

begin

read(n);

for i:=1 to n do

a[i,0]:=1;

for j:=1 to n do

for i:=0 to n do

a[i,j]:=a[i-1,j]+a[i+1,j-1];

write(a[0,n]);

end.

这样的话13行。。呵呵

#3 timetobehardworking@2009-05-10 21:51:00
回复 删除
你的在去掉

var

n,m,i,j,k,t:longint;

a:array[-5..100,-5..100] of longint;

begin

read(n);

for i:=1 to n do

a[i,0]:=1;

for j:=1 to n do

for i:=0 to n do

a[i,j]:=a[i-1,j]+a[i+1,j-1];

write(a[0,n]);

end.

12行。哈哈,还是没我的短

#4 xxwzy@2009-05-10 21:53:00
回复 删除
无聊啊
#5 timetobehardworking@2009-05-11 06:17:00
回复 删除
...
#6 863671241@2010-06-05 07:53:00
回复 删除
var

a:array[0..18] of longint;

i,j,x,n:longint;

begin

a[0]:=1;a[1]:=1;

readln(n);

for i:=2 to n do

for j:=1 to i do

a[i]:=a[j-1]*a[i-j]+a[i];

write(a[n]);

end.

才十行

#7 aaaassss@2010-06-06 02:24:00
回复 删除
。。。

无聊,不就是比谁长嘛。

没劲

#8 Mine_ysd@2010-06-06 03:00:00
回复 删除
9494
#9 WAharo@2010-08-05 19:26:00
回复 删除
94
#10 roger_97@2011-08-15 22:24:00
回复 删除
一行……

我还一行呢…………

var f:array [0..100] of longint;i,j,k,n:longint;begin read(n);f[1]:=1;for k:=2 to n+1 do for i:=1 to k-1 do f[k]:=f[k]+f[i]*f[k-i];write(f[n+1]);end.

查看更多回复
提交回复