var i,j,n:longint;
c:array[1..1500] of longint;
procedure jw;
var i,k:longint;
begin
for i:=1 to 1499 do if c[i]>9 then begin
k:=c[i] div 10;
c[i]:=c[i] mod 10;
c[i+1]:=c[i+1]+k;
end;
end;
begin
//assign(input,'gl.in');reset(input);
//assign(output,'gl.out');rewrite(output);
readln(n);
c[1]:=1;
for i:=1 to 63 do begin
for j:=1 to 1500 do c[j]:=c[j]*2;
jw;
end;
for i:=1500 downto 1 do if c[i]>0 then break;
for j:=i downto 1 do write(c[j]);
//close(input);close(output);
end.
用本人以前写的程序改来的,应该是可以的,程序思想很简单,参考参考吧。