http://wikioi.com/training/?id=32

筆者終于受不了把解題報告寫成教程的日子了，由于想寫些交流思維的東西，筆者決定放棄Wikioi上普及一等之前的所（僅）有（剩）的題目，只在這里留下代碼。

PS：其他等級的科普題也將省略詳細的講解……

Wikioi 天梯 二叉樹最大寬度和高度（1501）

Program asd; Varn,i,a,b,maxdeep,maxwide:longint;wide,deep:array[1..10000]of longint; Beginreadln(n);deep[1]:=1;wide[1]:=1;maxdeep:=1;maxwide:=1;for i:=1 to n dobeginread(a,b);if a<>0 thenbegindeep[a]:=deep[i]+1;inc(wide[deep[a]]);if deep[a]>maxdeep then maxdeep:=deep[a];if wide[deep[a]]>maxwide then maxwide:=wide[deep[a]];end;if b<>0 thenbegindeep[b]:=deep[i]+1;inc(wide[deep[b]]);if deep[b]>maxdeep then maxdeep:=deep[b];if wide[deep[b]]>maxwide then maxwide:=wide[deep[b]];end;end;writeln(maxwide,' ',maxdeep); End.
1842

Program asd; Varn,i:longint;f:array[-30..1]of longint;Beginf[1]:=5;f[0]:=5;for i:=-1 downto -30 dof[i]:=f[i+1]+f[i+2]+1;readln(n);if n>=0 then writeln(5)else writeln(f[n]); End.
3038

Program asd; Varn,i,a,tot:longint; Beginreadln(n);for i:=1 to n dobeginread(a);tot:=0;while a<>1 dobeginif odd(a) then a:=3*a+1 else a:=a div 2;inc(tot);end;writeln(tot);end; End.3143

Program asd; Varn,i,a,b:longint;tree:array[1..20]of recordl,r:longint;end;Procedure qian(aa:longint);beginwrite(aa,' ');if tree[aa].l<>0 then qian(tree[aa].l);if tree[aa].r<>0 then qian(tree[aa].r);end;Procedure zhong(aa:longint);beginif tree[aa].l<>0 then zhong(tree[aa].l);write(aa,' ');if tree[aa].r<>0 then zhong(tree[aa].r);end;Procedure hou(aa:longint);beginif tree[aa].l<>0 then hou(tree[aa].l);if tree[aa].r<>0 then hou(tree[aa].r);write(aa,' ');end;Beginreadln(n);for i:=1 to n do readln(tree[i].l,tree[i].r);qian(1);writeln;zhong(1);writeln;hou(1); End.

3145

Program asd; Varn:longint;Procedure hanoi(aa:longint;cc,dd,ee:char);beginif aa=1 thenbeginwriteln(1,' from ',cc,' to ',ee);exit;end;hanoi(aa-1,cc,ee,dd);writeln(aa,' from ',cc,' to ',ee);hanoi(aa-1,dd,cc,ee);end;Beginreadln(n);writeln(trunc(exp(ln(2)*n))-1);hanoi(n,'A','B','C'); End.

總結(jié)

以上是生活随笔為你收集整理的Wikioi 天梯 1501/1842/3038/3143/3145的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。