pascal 問題 高手進(jìn)

第一題：var n,s,i,l,j:longint;
a:array[1..200] of integer;
begin
readln(n);
a[1]:=1;l:=1;
for i:=1 to n-1 do
begin
for j:=1 to l do a[j]:=a[j]*2;
for j:=1 to l do
if a[j]>=10 then
begin
a[j+1]:=a[j+1]+a[j] div 10;
a[j]:=a[j] mod 10;
end;
while a[l+1]>0 do l:=l+1;
end;
for i:=l downto 1 do write(a[i]);
end.
第二題：
var i,n,k,s,t,x,r,m,time:integer;
begin
readln(n,k);
for i:=1 to k do
begin
readln(s,t,r);
x:=s*t;m:=n;
time:=m div x*(t+r);
m:=m mod x;
if m>0 then time:=time+m div s;
if m mod s<>0 then time:=time+1;
writeln(time)
end;
end.

1、
2的n-1次方種方法。
program a1;
var n,s,i:longint;
begin
readln(n);
s:=1;
for i:=1 to n-1 do s:=s*2;
writeln(s);
end.
2、