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 行。
program ping;
var n,m,i,j,k,t:longint;
a:array[-5..100,-5..100] of longint;
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]);
var
n,m,i,j,k,t:longint;
for i:=1 to n do
a[i,0]:=1;
for j:=1 to n do
这样的话13行。。呵呵
12行。哈哈,还是没我的短
a:array[0..18] of longint;
i,j,x,n:longint;
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]);
才十行
无聊,不就是比谁长嘛。
没劲
我还一行呢…………
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.
快速帮助 | 运行状态 | 反馈举报 | 关于我们 | 免责声明 | 浙ICP备11060257号 Processed in 0.0040 Second(s) Copyright (C) RQNOJ 2007-2019. All Rights Reserved.