237 条题解
-
0
BBTiger LV 5 @ 2009-02-07 10:52:42
数据实在太弱，我用递归都过了，本以为过不了
-
0
两次ac
由于integer........ps
n=1013就超了var
a:array[1..500] of longint;
n,i,j,ans:longint;
begin
readln(n);
for i:=1 to n shr 1 do a[i]:=1;
for i:=1 to n shr 1 do
for j:=1 to i shr 1 do
a[i]:=a[i]+a[j];
ans:=1;
for j:=1 to n shr 1 do
ans:=ans+a[j];
writeln(ans);
end. -
0
lilei333213 LV 3 @ 2008-12-17 13:03:52
var
a:array[1..10000] of longint;
i,j,k,n,w,e,r,t,y,u:longint;
begin
read (n);
for i:=1 to n div 2 do
k:=k+1;
for i:=1 to n div 2 do
for j:=1 to i div 2 do
k:=k+1;
for i:=1 to n div 2 do
for j:=1 to i div 2 do
for w:=1 to j div 2 do
k:=k+1;
for i:=1 to n div 2 do
for j:=1 to i div 2 do
for w:=1 to j div 2 do
for e:=1 to w div 2 do
k:=k+1;
for i:=1 to n div 2 do
for j:=1 to i div 2 do
for w:=1 to j div 2 do
for e:=1 to w div 2 do
for r:=1 to e div 2 do
k:=k+1;
for i:=1 to n div 2 do
for j:=1 to i div 2 do
for w:=1 to j div 2 do
for e:=1 to w div 2 do
for r:=1 to e div 2 do
for t:=1 to r div 2 do
k:=k+1;
for i:=1 to n div 2 do
for j:=1 to i div 2 do
for w:=1 to j div 2 do
for e:=1 to w div 2 do
for r:=1 to e div 2 do
for t:=1 to r div 2 do
for y:=1 to t div 2 do
k:=k+1;
for i:=1 to n div 2 do
for j:=1 to i div 2 do
for w:=1 to j div 2 do
for e:=1 to w div 2 do
for r:=1 to e div 2 do
for t:=1 to r div 2 do
for y:=1 to t div 2 do
for u:=1 to y div 2 do
k:=k+1;
k:=k+1;
write (k);
end.什么都不用。。。。
非常白痴的算法。。。。
这都能过。。。。。。。。 -
0
DP……可惜读不大懂题意……
编译通过...
├ 测试数据 01：答案正确... 0ms
├ 测试数据 02：答案正确... 0ms
├ 测试数据 03：答案正确... 0ms
├ 测试数据 04：答案正确... 0ms
├ 测试数据 05：答案正确... 0ms
---|---|---|---|---|---|---|---|-
Accepted 有效得分：100 有效耗时：0msvar
n,i,j:integer;
f:array[0..1000]of longint;begin
read(n);
fillchar(f,sizeof(f),0);
f[1]:=1;
for i:=2 to n do
begin
for j:=1 to i div 2 do
f[i]:=f[i]+f[j];
inc(f[i]);
end;
writeln(f[n]);
end.Flag Accepted
题号 P1130
类型(?) 其它
通过 3687人
提交 6146次
通过率 60%
难度 1提交 讨论 题解
-
0
sw81500345 LV 5 @ 2008-11-18 22:37:08
I am LoLo,你把你的程序数组初始化一下
初值都赋值为1（本身一种情况）
程序很简单
for i:=1 to n do
for j:=1 to i div 2 do
a[i]:=a[i]+a[j]; -
0
zltchenhana LV 3 @ 2008-11-09 18:29:40
program count;
var
n:longint;
a:array[1..1000] of longint;
procedure deal(i:longint);
var
j:longint;
begin
if a[i]0 then exit;
a[i]:=1;
for j:=1 to (i div 2) do
begin
deal(j);
inc(a[i],a[j]);
end;
end;
begin
readln(n); fillchar(a,sizeof(a),0);
deal(n);
write(a[n]);
end. -
0
wjw0011996 LV 8 @ 2008-11-09 10:40:18
结果要用longint!!!!我的AC率啊
-
0
zhangjuchuan LV 4 @ 2008-11-09 10:33:58
编译通过...
├ 测试数据 01：答案正确... 0ms
├ 测试数据 02：答案正确... 0ms
├ 测试数据 03：答案正确... 0ms
├ 测试数据 04：答案正确... 0ms
├ 测试数据 05：答案正确... 0ms
---|---|---|---|---|---|---|---|-
Accepted 有效得分：100 有效耗时：0ms
BBTiger
LV 5
@ 2009-02-07 10:52:42
